P69: Enumeration of all stable marriage

P69: Enumeration of all stable marriage

Input:

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

Output:

All stable marriage of $G$.

Complexity:

$O(|V|)$ time per solution and $O(|V|^2)$ space.

Comment:

Reference:

[Gusfield1989] (Bibtex)