P57: Enumeration of the $k$ best perfect matchings of a graph

P57: Enumeration of the $k$ best perfect matchings of a graph

Input:

A graph $G = (V, E)$ and an integer $k$.

Output:

The $k$ best perfect matchings of $G$ in order.

Complexity:

$O(k|V|^3)$ total time.

Comment:

Reference:

[Chegireddy1987] (Bibtex)