Algorithm 457: finding all cliques of an undirected graph
- 1 September 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 16 (9) , 575-577
- https://doi.org/10.1145/362342.362367
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Corrections to Bierstone's Algorithm for Generating CliquesJournal of the ACM, 1972
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- On cliques in graphsIsrael Journal of Mathematics, 1965
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963