International Journal of Computer & Information Sciences

, Volume 5, Issue 3, pp 209–238

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

  • H. C. Johnston

DOI: 10.1007/BF00991836

Cite this article as:
Johnston, H.C. International Journal of Computer and Information Sciences (1976) 5: 209. doi:10.1007/BF00991836


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.

Key words

Cliquescombinatorial programminggraph theorystepwise refinementtree search

Copyright information

© Plenum Publishing Corporation 1976

Authors and Affiliations

  • H. C. Johnston
    • 1
  1. 1.Department of Computer ScienceQueen's University of BelfastBelfastNorthern Ireland