Algorithm 457: finding all cliques of an undirected graph

Public

Published in Communications of the ACM • Sep 1, 1973

Authors:

Coen Bron

Joep Kerbosch

Abstract

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

Research Assistant

AI chat, annotations, notes & similar papers

Finding related papers...

(0)

No comments yet

Be the first to share your thoughts!