@inproceedings{2ea9af265da94d40aef763d6aa3f99b0,
title = "An output sensitive algorithm for maximal clique enumeration in sparse graphs",
abstract = "The degeneracy of a graph G is the smallest integer k such that every subgraph of G contains a vertex of degree at most k. Given an n-order k-degenerate graph G, we present an algorithm for enumerating all its maximal cliques. Assuming that α is the number of maximal cliques of G, our algorithm has setup time O(n(k2 +s(k +1))) and enumeration time αO((k + 1)f(k + 1)) where s(k + 1) (resp. f(k + 1)) is the preprocessing time (resp. enumeration time) for maximal clique enumeration in a general (k + 1)-order graph. This is the first output sensitive algorithm whose enumeration time depends only on the degeneracy of the graph.",
keywords = "Enumeration algorithms, K-degenerate graphs, Maximal cliques",
author = "George Manoussakis",
note = "Publisher Copyright: {\textcopyright} 2018 George Manoussakis.; 12th International Symposium on Parameterized and Exact Computation, IPEC 2017 ; Conference date: 06-09-2017 Through 08-09-2017",
year = "2018",
month = feb,
day = "1",
doi = "10.4230/LIPIcs.IPEC.2017.27",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Daniel Lokshtanov and Naomi Nishimura",
booktitle = "12th International Symposium on Parameterized and Exact Computation, IPEC 2017",
address = "Germany",
}