Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Bron–Kerbosch algorithm · Vinony

EntityQ2031707· pop 6· linked from 8 articles

Bron–Kerbosch algorithm

Sign in to save

a recursive backtracking algorithm for finding maximal cliques in an undirected graph

Connections

time complexity

computer science

International Standard Book Number

digital object identifier

computational chemistry

list of algorithms

Mathematical Reviews

Categories

Graph algorithms

Sources

wikipedia.externallinksexternallink

What links here8 pages

community structure

maximal independent set

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.43

Entitydist 0.49

breadth-first search

Entitydist 0.51

Template:Graph traversal algorithms

Entitydist 0.52

Brouwer–Haemers graph

Entitydist 0.53

connected component of a graph

Entitydist 0.53

Barabási–Albert model

Entitydist 0.56

depth-first search

Entitydist 0.59

minimum spanning tree

Entitydist 0.59

graph data structure

Entitydist 0.60

Entitydist 0.61

graph-structured stack

Entitydist 0.62