by
David Eppstein

Citations: | 18 - 2 self |

@MISC{Eppstein92findingthe,

author = {David Eppstein},

title = {Finding the k Smallest Spanning Trees},

year = {1992}

}

We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log #(m, n)+k 2 ); for planar graphs this bound can be improved to O(n + k 2 ). We also show that the k best spanning trees for a set of points in the plane can be computed in time O(min(k 2 n + n log n, k 2 + kn log(n/k))). The k best orthogonal spanning trees in the plane can be found in time O(n log n + kn log log(n/k)+k 2 ).

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2014 The Pennsylvania State University