Algorithm 457: finding all cliques of an undirected graph

@article{Bron1973Algorithm4F,
  title={Algorithm 457: finding all cliques of an undirected graph},
  author={C. Bron and J. Kerbosch},
  journal={Communications of The ACM},
  year={1973},
  volume={16},
  pages={575-577}
}
Description bttroductian. [...] Key Method The first version is a straightforward implementation of the basic algorithm. It is mainly presented to illustrate the method used. This version generates cliques in alphabetic (lexicographic) order. The second version is derived from the first and generates cliques in a rather unpredictable order in an attempt to minimize the number of branches to be traversed.Expand

Figures from this paper

Listing all maximal cliques in large graphs on vertex-centric model
TLDR
New efficient distributed algorithms for maximal clique enumerating based on the vertex-centric model using the BK algorithm principle are proposed and can effectively process a variety of large real-world and computer-generated graphs and scale well with increasing the dataset size and the number of nodes in the cluster. Expand
Comparison of Clique-Listing Algorithms
TLDR
Five cliqueor MIS-listing algorithms are compared, and variations of the Bron and Kerbosch algorithm appear to be the fastest for random graphs and a type of graph which arises in physical mapping of genomes. Expand
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
TLDR
In this paper a new algorithm, termed “clique branching,” is proposed that exploits a special structure inherent in the association graph that contains a large number of naturally-ordered cliques that are present in the Association graph’s complement. Expand
A linear time algorithm for maximal clique enumeration in large sparse graphs
TLDR
This paper proposes a linear time algorithm, CM-Constructor (Candidate Map Constructor), for maximal clique enumeration in large sparse graphs which generates a novel data structure called candidate map as result. Expand
A new decomposition technique for maximal clique enumeration for sparse graphs
TLDR
Using a new decomposition technique, two output sensitive algorithms for the maximal clique enumeration problem are presented, one of which has enumeration time depending on the degeneracy and the maximum degree and the other which only requires memory polynomial inThe degeneracy of the graph. Expand
Finding a Summary for All Maximal Cliques
TLDR
The proposed method can reduce the number of bound calculations by 3 ∼ 5 orders of magnitude, and each run of the algorithm can be up to 2.x times faster than the state-of-the-art algorithm while still keeping the summary concise. Expand
Common subgraph isomorphism detection by backtracking search
TLDR
An improved backtracking algorithm for CSI is proposed, which differs from its predecessors by better search strategy and is therefore more efficient and found that the new algorithm outperforms the traditional maximal clique approach by orders of magnitude in computational time. Expand
An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures
TLDR
A new suitable representation of the secondary structure topology of a protein by an undirected labeled graph is described and a new fast algorithm is developed that finds all common subtopologies in a set of protein structures. Expand
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication
TLDR
Improve the asymptotics for the exploration of the same RS-tree by grouping the offsprings’ computation even further and rely on rectangular fast matrix multiplication in order to compute all children of n^2$$n2 nodes in one single shot. Expand
An Effective Algorithm for Extracting Maximal Bipartite Cliques
TLDR
The proposed algorithm adds the minimal number of edges that are required to convert all maximal bipartite cliques to maximal cliques, which is accurate, efficient, effective, and applicable to real world graphs more than the traditional algorithm. Expand
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
An Analysis of Some Graph Theoretical Cluster Techniques
TLDR
Several graph theoretic cluster techniques aimed at the automatic generation of thesauri for information retrieval systems are explored and two algorithms have been tested that find maximal complete subgraphs. Expand
Corrections to Bierstone's Algorithm for Generating Cliques
TLDR
The counterexamples to their and the modified version of the Bierstone algorithm for finding the set of cliques of a finite undirected linear graph are presented. Expand
On cliques in graphs
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliquesExpand
Finding cliques in an undirected graph
TLDR
The final author version and the galley proof are versions of the publication after peer review that features the final layout of the paper including the volume, issue and page numbers. Expand
Algorithm 202: generation of permutations in lexicographical order
TLDR
The semiiterative method can be programmed in a very short time for any multiple precision and is efficient in comparison with taking more terms of the Taylor's series, taking into account the divisions required for the square root process. Expand
Added in proof: An improved version of BESTLEX, viz. Algorithm 323A, Generation of Permutation Sequences: Part 2, by
  • Comm. ACM