ACM Home Page
Please provide us with feedback. Feedback
Algorithm 457: finding all cliques of an undirected graph
Full text PdfPdf (457 KB)
Source
Communications of the ACM archive
Volume 16 ,  Issue 9  (September 1973) table of contents
Pages: 575 - 577  
Year of Publication: 1973
ISSN:0001-0782
Authors
Coen Bron  Technological Univ. Eindhoven, Eindhoven, The Netherlands
Joep Kerbosch  Technological Univ. Eindhoven, Eindhoven, The Netherlands
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 113,   Downloads (12 Months): 976,   Citation Count: 68
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/362342.362367
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Bierstone, E. Unpublished report. U of Toronto.
 
3
Bron, C., Kerbosch, J.A.G.M., and Schell, H.J. Finding cliques in an undirected graph. Tech. Rep. Technological U. of Eindhoven, The Netherlands.
 
4
Little, John D.C., et al. An algorithm for the traveling salesman problem. Oper. Res. 11 (1963), 972-989.
 
5
Moon, J.W., and Moser, L. On cliques in graphs. Israel J. Math. 3 (1965), 23-28.
6

CITED BY  68

Collaborative Colleagues:
Coen Bron: colleagues
Joep Kerbosch: colleagues