P48: Enumeration of the $k$ best spanning trees in a planar graph

P48: Enumeration of the $k$ best spanning trees in a planar graph

Input:

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

Output:

The $k$ best spanning trees of $G$.

Complexity:

$O(n + k^2)$ total time

Comment:

Reference:

[Eppstein1992] (Bibtex)