Motivated by the discovery of combinatorial patterns in an undirected graph G with n vertices and m edges, we study the problem of listing all the trees with k vertices that are subgraphs of G. We present the first optimal output-sensitive algorithm, i.e. runs in O(sk) time where s is the number of these trees in G, and uses O(m) space. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ferreira, R., Grossi, R., & Rizzi, R. (2011). Output-sensitive listing of bounded-size trees in undirected graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6942 LNCS, pp. 275–286). https://doi.org/10.1007/978-3-642-23719-5_24
Mendeley helps you to discover research relevant for your work.