BIT Numerical Mathematics

, Volume 32, Issue 2, pp 237–248

Finding thek smallest spanning trees

Authors

  • David Eppstein
    • Department of Information and Computer ScienceUniversity of California
Algorithm Theory

DOI: 10.1007/BF01994879

Cite this article as:
Eppstein, D. BIT (1992) 32: 237. doi:10.1007/BF01994879
  • 41 Views

Abstract

We give improved solutions for the problem of generating thek smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes timeO(m logβ(m, n)=k2); for planar graphs this bound can be improved toO(n+k2). We also show that thek best spanning trees for a set of points in the plane can be computed in timeO(min(k2n+n logn,k2+kn log(n/k))). Thek best orthogonal spanning trees in the plane can be found in timeO(n logn+kn log log(n/k)+k2).

C.R. categories

F.1.3F.2.2G.2.2I.2.8

Copyright information

© BIT Foundations 1992