P32: Enumeration of all perfect, maximum, and maximal matchings in bipartite graphs

P32: Enumeration of all perfect, maximum, and maximal matchings in bipartite graphs

Input:

A bipartite graph $B=(V, E)$.

Output:

All perfect, maximum, and maximal matching in $B$.

Complexity:

$O(|V|)$ time per matching.

Comment:

Reference:

[Uno1997] (Bibtex)