PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 1, 1973Communications of the ACM2,480 citationsOpen Access

Algorithm 457: finding all cliques of an undirected graph

CBCoen BronJKJoep Kerbosch

Key Points

Key points are not available for this paper at this time.

Abstract

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

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Bron et al. (1973) studied this question.

synapsesocial.com/papers/69d6fd8e733a2b54c8aa883chttps://doi.org/10.1145/362342.362367
Ask AI
Helpful
Bookmark
Share
View Full Paper