Listing all maximal cliques in sparse graphs in near-optimal time


The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal cliques, parametrized by degeneracy. To achieve this result, we modify the classic Bron–Kerbosch algorithm and show that… (More)
DOI: 10.1007/978-3-642-17517-6_36


3 Figures and Tables


Citations per Year

143 Citations

Semantic Scholar estimates that this publication has 143 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Eppstein2010ListingAM, title={Listing all maximal cliques in sparse graphs in near-optimal time}, author={David Eppstein and Maarten L{\"o}ffler and Darren Strash}, booktitle={Exact Complexity of NP-hard Problems}, year={2010} }