arXiv (All)
open access
The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A maximum matching based refinement of Brouwers conjecture#1070156
- On $k$-limited domination: complexity and Cartesian products#1156397
- Optimizing the CGMS upper bound on Ramsey numbers#793389
- Optimizing the CGMS upper bound on Ramsey numbers#789385
- Retained-Set Descent for Diagonal Ramsey Numbers#1084471
Record · ID 821633
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive