⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

September 1, 1973Communications of the ACMOpen Access

Algorithm 457: finding all cliques of an undirected graph

Coen Bron Joep Kerbosch

View Full Paper

Ask AI

Bookmark

Share

Abstract

bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete subgraph.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Bron et al. (1973) studied this question.

synapsesocial.com/papers/69d6fd8e733a2b54c8aa883c https://doi.org/10.1145/362342.362367

View Full Paper

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1An Analysis of Some Graph Theoretical Cluster TechniquesOriginal Research · 1970 · 229 citations
2An Algorithm for the Traveling Salesman ProblemOriginal Research · 1963 · 1,059 citations
3Corrections to Bierstone's Algorithm for Generating CliquesOriginal Research · 1972 · 72 citations
4Agency as a New Organizing Abstraction for Computer ScienceCommunications of the ACM · Wed,
5A Research Agenda for the Economics of Transformative AICommunications of the ACM · Wed,

More from Communications of the ACM

How Immigration and Federal Funding Sustain American AI LeadershipTue,
A New Era for Inside RisksTue,
Considering AI’s Dependence On Human AgencyMon,
Teaching Novice Computing and Programming in the Agentic AI EraMon,
Is Recursive Self-Improvement Really Here?Fri,