𝔖 Bobbio Scriptorium

✦ LIBER ✦

An algorithm for finding all maximal complete subgraphs and an estimate of the order of computational complexity

✍ Scribed by S.R. Das; C.L. Sheng; Z. Chen

Book ID: 113211604
Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 322 KB
Volume: 5
Category: Article
ISSN: 0045-7906
DOI: 10.1016/0045-7906(78)90009-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Magnitude ordering of degree complements

Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs

✍ S.R. Das; C.L. Sheng; Z. Chen; T. Lin 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 741 KB

An effective algorithm for string correc

An effective algorithm for string correction using generalized edit distance—II. Computational complexity of the algorithm and some applications

✍ R.L. Kashyap; B.J. Oommen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 981 KB

[ACM Press the fourteenth international

[ACM Press the fourteenth international conference - Philadelphia, Pennsylvania, USA (2012.07.07-2012.07.11)] Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference - GECCO '12 - An efficient genetic algorithm for subgraph isomorphism

✍ Choi, Jaeun; Yoon, Yourim; Moon, Byung-Ro 📂 Article 📅 2012 🏛 ACM Press ⚖ 401 KB

[IEEE 2011 IEEE International Symposium

[IEEE 2011 IEEE International Symposium on Circuits and Systems (ISCAS) - Rio de Janeiro, Brazil (2011.05.15-2011.05.18)] 2011 IEEE International Symposium of Circuits and Systems (ISCAS) - An efficient algorithm for the conjugate symmetric sequency-ordered complex Hadamard transform

✍ Bouguezel, Saad; Ahmad, M. Omair; Swamy, M.N.S. 📂 Article 📅 2011 🏛 IEEE ⚖ 363 KB

MAGNA CARTAThe Great CharterPreamble

MAGNA CARTAThe Great CharterPreamble

📂 Fiction 🌐 English ⚖ 11 KB 👁 18 views