Bron-Kerbosch Algorithm

Bron-Kerbosch Algorithm

List price: US$44.01

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, the Bron-Kerbosch algorithm is an algorithm for finding maximal cliques in an undirected graph. That is, it lists all subsets of vertices with the two properties that each pair of vertices in one of the listed subsets is connected by an edge, and no listed subset can have any additional vertices added to it while preserving its complete connectivity. The Bron-Kerbosch algorithm was designed by Dutch scientists Joep Kerbosch and Coenraad Bron, who published a description of it in 1973. Although other algorithms for solving the clique problem have running times that are, in theory, better on inputs that have few maximal independent sets, the Bron-Kerbosch algorithm and subsequent improvements to it are frequently reported as being more efficient in practice than the alternatives. It is well-known and widely used in application areas of graph algorithms such as computational chemistry.
show more

Product details

  • Paperback | 96 pages
  • 152 x 229 x 6mm | 150g
  • United States
  • English
  • black & white illustrations
  • 6136404559
  • 9786136404554