Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs
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.
KeywordsSpan Tree Undirected Graph Recursive Call Internal Edge External Edge
Unable to display preview. Download preview PDF.