article Open AccessTop 10% cited
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM · 1973 · Vol. 16(9) · pp. 575–577
Coen Bron✉(Eindhoven University of Technology)Joep Kerbosch(Eindhoven University of Technology)
Abstract
bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete subgraph.
Advanced Graph Theory ResearchGraph Labeling and Dimension Problemsgraph theory and CDMA systemsCitationGraphComputer scienceWorld Wide WebTheoretical computer science
Citations
2,429
FWCI
3.28
field-weighted impact
References
6
Percentile
94%
vs. same field & year
Citations per year
Cited by
Community detection in graphs
Physics Reports · 2009 · 11,132 citations
Detect overlapping and hierarchical community structure in networks
Physica A Statistical Mechanics and its Applications · 2008 · 722 citations
Community detection in networks: A user guide
Physics Reports · 2016 · 1,765 citations
Network location and learning: the influence of network resources and firm capabilities on alliance formation
Strategic Management Journal · 1999 · 2,387 citations
Community detection algorithms: A comparative analysis
Physical Review E · 2009 · 2,189 citations
References
An Algorithm for the Traveling Salesman Problem
Operations Research · 1963 · 1,041 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.