Finding the k smallest spanning trees

  • David Eppstein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 447)


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(mlogβ(m, n)+k2); for planar graphs this bound can be improved to O(n+k2). We also show that the k best spanning trees for a set of points in the plane can be computed in time O(min(k2n+nlogn, k2+knlog(n/k))). The k best orthogonal spanning trees in the plane can be found in time O(nlogn+knloglog(n/k)+k2).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aggarwal, H. Imai, N. Katoh, and S. Suri, Finding k Points with Minimum Diameter and Related Problems, J. Algorithms, to appear.Google Scholar
  2. [2]
    A. Aggarwal and J. Wein, Computational Geometry, MIT LCS Research Seminar Series 3, 1988.Google Scholar
  3. [3]
    M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, Time Bounds for Selection, J. Comput. Syst. Sci. 7, 1972, 448–461.Google Scholar
  4. [4]
    H. Booth and J. Westbrook, Linear Algorithms for Analysis of Minimum Spanning and Shortest Path Trees in Planar Graphs, Tech. Rep. TR-763, Department of Computer Science, Yale University, Feb. 1990.Google Scholar
  5. [5]
    R.N. Burns and C.E. Haff, A Ranking Problem in Graphs, 5th Southeast Conf. Combinatorics, Graph Theory and Computing 19, 1974, 461–470.Google Scholar
  6. [6]
    P.M. Camerini, L. Fratta, and F. Maffioli, The k Shortest Spanning Trees of a Graph, Int. Rep. 73-10, IEEE-LCE Politechnico di Milano, Italy, 1974.Google Scholar
  7. [7]
    D. Cheriton and R.E. Tarjan, Finding Minimum Spanning Trees, SIAM J. Comput. 5, 1976, 310–313.Google Scholar
  8. [8]
    L.P. Chew and S. Fortune, Sorting helps for Voronoi diagrams, 13th Symp. Mathematical Progr., Japan, 1988.Google Scholar
  9. [9]
    D. Eppstein, Z. Galil, R. Giancarlo, and G.F. Italiano, Sparse Dynamic Programming, 1st ACM-SIAM Symp. Discrete Algorithms, San Francisco, 1990, 513–522.Google Scholar
  10. [10]
    D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook, and M. Yung, Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph, 1st ACM-SIAM Symp. Discrete Algorithms, to appear.Google Scholar
  11. [11]
    G.N. Frederickson, Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications, SIAM J. Comput. 14(4), 1985, 781–798.Google Scholar
  12. [12]
    H.N. Gabow, Two Algorithms for Generating Weighted Spanning Trees in Order, SIAM J. Comput. 6, 1977, 139–150.Google Scholar
  13. [13]
    H.N. Gabow, Z. Galil, T.H. Spencer, and R.E. Tarjan, Efficient Algorithms for Minimum Spanning Trees on Directed and Undirected Graphs, Combinatorica 6, 1986, 109–122.Google Scholar
  14. [14]
    N. Katoh, T. Ibaraki, and H. Mine, An Algorithm for Finding k Minimum Spanning Trees, SIAM J. Comput. 10, 1981, 247–255.Google Scholar
  15. [15]
    E.W. Mayr and C.G. Plaxton, On the spanning trees of weighted graphs, manuscript, 1990.Google Scholar
  16. [16]
    N. Sarnak and R.E. Tarjan, Planar Point Location using Persistent Search Trees, C. ACM 29(7), 1986, 669–679.Google Scholar
  17. [17]
    R.E. Tarjan, Applications of Path Compression on Balanced Trees, J. ACM 26, 1979, 690–715.Google Scholar
  18. [18]
    P. van Emde Boas, Preserving Order in a Forest in Less than Logarithmic Time, 16th IEEE Symp. Found. Comput. Sci., 1975, and Info. Proc. Lett. 6, 1977, 80–82.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • David Eppstein
    • 1
  1. 1.Xerox Palo Alto Research CenterPalo Alto

Personalised recommendations