David Eppstein, Maarten Löffler, Darren Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin, editors, Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010. Volume 10441 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2010. [doi]
@inproceedings{EppsteinLS10-0,
title = {Listing all maximal cliques in sparse graphs in near-optimal time},
author = {David Eppstein and Maarten Löffler and Darren Strash},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/2935/},
researchr = {https://researchr.org/publication/EppsteinLS10-0},
cites = {0},
citedby = {0},
booktitle = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010},
editor = {Thore Husfeldt and Dieter Kratsch and Ramamohan Paturi and Gregory B. Sorkin},
volume = {10441},
series = {Dagstuhl Seminar Proceedings},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany},
}