, Volume 18, Issue 2, pp 263–270 | Cite as

A simpler minimum spanning tree verification algorithm



The problem considered here is that of determining whether a given spanning tree is a minimal spanning tree. In 1984 Komlós presented an algorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make. We simplify his algorithm and give a linear-time procedure for its implementation in the unit cost RAM model. The procedure uses table lookup of a few simple functions, which we precompute in time linear in the size of the tree.

Key Words

Minimum spanning tree Verification 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    B. Dixon, M. Rauch, and R. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time,SIAM J. Comput.,21(6) (1992), 1184–1192.zbMATHMathSciNetCrossRefGoogle Scholar
  2. [2]
    D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors,SIAM J. Comput.,13 (1984), 338–355.zbMATHMathSciNetCrossRefGoogle Scholar
  3. [3]
    D. Karger, P. N. Klein, and R. E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees,J. Assoc. Comput. Mach.,42 (1995), 321–328.zbMATHMathSciNetGoogle Scholar
  4. [4]
    J. Komlós, Linear verification for spanning trees,Combinatorica,5 (1985), 57–65.zbMATHMathSciNetGoogle Scholar
  5. [5]
    B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization,SIAM J. Comput.,17 (1988), 1253–1262.zbMATHMathSciNetCrossRefGoogle Scholar
  6. [6]
    R. Tarjan, Applications of path compressions on balanced trees,J. Assoc. Comput. Mach.,26 (1979), 690–715.zbMATHMathSciNetGoogle Scholar
  7. [7]
    R. Tarjan,Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, SIAM, Philadelphia, PA, 1983, p. 73.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • V. King
    • 1
  1. 1.Department of Computer ScienceUniversity of VictoriaVictoriaCanada

Personalised recommendations