Finding all Cliques of an Undirected Graph   [UG]

by

Bron, C. and Kerbosch, J.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Communications of the ACM (Journal), 1973, p. 575-577
Notes:
An implicit enumeration algorithm for listing all cliques in a graph. Includes easily translated code.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@Article{Bron:1973:FAC,
  author =       "Coen Bron and Joep Kerbosch",
  journal =      "Communications of the ACM",
  number =       "9",
  pages =        "575--577",
  title =        "Finding all Cliques of an Undirected Graph",
  volume =       "16",
  year =         "1973",
  annote =       "An implicit enumeration algorithm for listing all
                 cliques in a graph. Includes easily translated code.",
}