@inproceedings{7c98ea6546ec4063a97739287481904b,

title = "Listing all fixed-length simple cycles in sparse graphs in optimal time",

abstract = "The degeneracy of an n-vertex graph G is the smallest number k such that every subgraph of G contains a vertex of degree at most k. We present an algorithm for enumerating all simple cycles of length p in an n-order k-degenerate graph running in time O(n⌊p/2⌋ k⌈p/2⌉). We then show that this algorithm is worst-case output size optimal by proving a Θ(n⌊p/2⌋ k⌈p/2⌉) bound on the maximal number of simple p-length cycles in these graphs. Our results also apply to induced (chordless) cycles.",

keywords = "Fixed-size cycles listing, Sparse graphs, k-degenerate",

author = "George Manoussakis",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag GmbH Germany 2017.; 21st International Symposium on Fundamentals of Computation Theory, FCT 2017 ; Conference date: 11-09-2017 Through 13-09-2017",

year = "2017",

month = jan,

day = "1",

doi = "10.1007/978-3-662-55751-8_28",

language = "English",

isbn = "9783662557501",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "355--366",

editor = "Marc Zeitoun and Ralf Klasing",

booktitle = "Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Proceedings",

address = "Germany",

}