Cliques of a graph-variations on the Bron-Kerbosch algorithm

@article{Johnston1976CliquesOA,
  title={Cliques of a graph-variations on the Bron-Kerbosch algorithm},
  author={H. C. Johnston},
  journal={International Journal of Computer & Information Sciences},
  year={1976},
  volume={5},
  pages={209-238}
}
This paper develops a family of algorithms that are variations on the Bron-Kerbosch algorithm for finding all the cliques of a simple undirected graph. The algorithms are developed in a stepwise manner, from a recursive algorithm for generating all combinations of zero or more objects chosen fromN objects. Experimental results are given. 
Highly Cited
This paper has 65 citations. REVIEW CITATIONS
38 Citations
1 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 38 extracted citations

66 Citations

0510'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

E . A . Akkoyunlu , The enumeration of maximal cliques of large graphs , S I A M J

  • R. M. Burstall
  • Computing

Similar Papers

Loading similar papers…