In computer science, the Bron–Kerbosch algorithm is an enumeration algorithm for finding all maximal cliques in an undirected graph. That is, it lists...

time algorithm is known for this problem, more efficient algorithms than the brute-force search are known. For instance, the Bron–Kerbosch algorithm can...

system. Together with Joep Kerbosch he invented the Bron–Kerbosch algorithm for the clique problem. Born in Amsterdam, Bron read Chemistry at Utrecht University...

the A* search algorithm Uniform-cost search: a tree search that finds the lowest-cost route where costs vary Cliques Bron–Kerbosch algorithm: a technique...

(2003). Eppstein (2003). For a matching bound for the widely used Bron–Kerbosch algorithm, see Tomita, Tanaka & Takahashi (2006). Bomze et al. (1999); Eppstein...

Nevertheless, many algorithms for computing cliques have been developed, either running in exponential time (such as the Bron–Kerbosch algorithm) or specialized...

enumerating maximal cliques in an input graph, e.g., with the Bron–Kerbosch algorithm Listing all elements of structures such as matroids and greedoids...

not the subgraph of any other clique. The classic algorithm to find these is the Bron–Kerbosch algorithm. The overlap of these can be used to define communities...

independent sets of an n-vertex graph, and in the time analysis of the Bron–Kerbosch algorithm for finding these sets. Several important strongly regular graphs...