Abstract
We consider the problem of enumerating all connected induced subgraphs of order k in an undirected graph G=(V,E). Our main results are two enumeration algorithms with a delay of (formula Presented) where Δ is the maximum degree in the input graph. This improves upon a previous delay bound [Elbassioni, JGAA 2015] for this problem. In addition, we give improved worst-case running time bounds and delay bounds for several known algorithms and perform an experimental comparison of these algorithms for k≤ 10 and (formula Presented).
Cite
CITATION STYLE
Komusiewicz, C., & Sommer, F. (2019). Enumerating connected induced subgraphs: Improved delay and experimental comparison. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11376 LNCS, pp. 272–284). Springer Verlag. https://doi.org/10.1007/978-3-030-10801-4_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
