P483: Enumeration of all spanning trees in a graph

P483: Enumeration of all spanning trees in a graph

Input:

A graph $G = (V, E)$.

Output:

All spanning trees in $G$.

Complexity:

Comment:

[Mai1984] proposes a parallel method for the enumeration.

Reference:

[Mai1984] (Bibtex)