P361: Enumeration of all undirected minimum spanning trees in an undirected graph

P361: Enumeration of all undirected minimum spanning trees in an undirected graph

Input:

An undirected graph $G = (V, E)$.

Output:

All undirected minimum spanning trees in $G$.

Complexity:

$O(|E|\log \beta(|E|, |V|))$ total time.

Comment:

$\beta(|E|, |V|) = \min\{i | \log^{(i)}|V| \le |E|/|N|\}$.

Reference:

[Gabow1986a] (Bibtex)