P119: Enumeration of all bases of a matching matroid in a graph

P119: Enumeration of all bases of a matching matroid in a graph

Input:

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

Output:

All bases of a matching matroid in $G$.

Complexity:

$O(|V| + |E|)$ time per solution.

Comment:

Reference:

[Uno1998] (Bibtex)