P88: Generation of the $k$-th minimum spanning tree in a graph

P88: Generation of the $k$-th minimum spanning tree in a graph

Input:

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

Output:

The $k$-th minimum spanning tree of $G$.

Complexity:

$O((|V||E|)^{k-1})$ time.

Comment:

Reference:

[Mayr1992] (Bibtex)