P118: Enumeration of all bases of a linear matroid in a graph

P118: Enumeration of all bases of a linear matroid in a graph

Input:

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

Output:

All bases of a linear matroid in $G$.

Complexity:

$O(|V|)$ time per solution and $O(|V|^2|E|)$ preprocessing after time.

Comment:

Reference:

[Uno1998] (Bibtex)