✦ LIBER ✦

Algorithm to assist in finding the Complete Sub-graphs of a Given Graph

✍ Scribed by MEETHAM, A. R.

Book ID: 109651867
Publisher: Nature Publishing Group
Year: 1966
Tongue: English
Weight: 123 KB
Volume: 211
Category: Article
ISSN: 0028-0836
DOI: 10.1038/211105a0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for finding the l

An efficient algorithm for finding the largest chain graph according to a given chain graph

✍ Baijun Liu; Zhongguo Zheng; Hui Zhao 📂 Article 📅 2005 🏛 SP Science China Press 🌐 English ⚖ 239 KB

A Linear-Time Algorithm for Finding a Co

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph

✍ Dujmović, Vida; Harvey, Daniel J.; Joret, Gwenaël; Reed, Bruce; Wood, David R. 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 136 KB

Local search algorithms for finding the

Local search algorithms for finding the Hamiltonian completion number of line graphs

✍ Paolo Detti; Carlo Meloni; Marco Pranzo 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 409 KB

An algorithm to find two distance domina

An algorithm to find two distance domination parameters in a graph

✍ Gerd H. Fricke; Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 467 KB

A Quadratic Algorithm for Finding Next-t

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs

✍ Kuo-Hua Kao; Jou-Ming Chang; Yue-Li Wang; Justie Su-Tzu Juan 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 1022 KB

The maximum number of complete subgraphs

The maximum number of complete subgraphs in a graph with given maximum degree

✍ Cutler, Jonathan; Radcliffe, A.J. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 243 KB