P376: Enumeration of all induced subtrees in a $k$-degenerate graph

P376: Enumeration of all induced subtrees in a $k$-degenerate graph

Input:

A $k$-degenerate graph $G = (V, E)$.

Output:

All induced subtrees in $G$.

Complexity:

$O(k)$ amortized time per solution with $O(|V| + |E|)$ space and preprocessing time.

Comment:

Reference:

[Wasa2014] (Bibtex)