Skip to main content
SpringerLink
Log in

A simpler minimum spanning tree verification algorithm

  • Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 955))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Dixon, M. Rauch, R. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, SIAM Journal of Computing, vol.21. Nov. 6, pp.1184–1192, (Dec. 1992).

    Article  Google Scholar 

  2. D.Harel and R.E. Tarjan. Fast Algorithms for finding nearest common ancestors, SIAM J. Computing, vol. 13 (1984), pp. 338–355.

    Article  Google Scholar 

  3. D. Karger. Global min-cuts in RNC and other ramifications of a simple mincut algorithm,” Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, pp.21–30.

    Google Scholar 

  4. P. Klein and R. Tarjan. A randomized linear-time algorithm for finding minimum spanning trees, Twenty-Sixth Annual ACM Symposium on Theory of Computing, (1994), pp. 9–15.

    Google Scholar 

  5. J. Komlós, Linear verification for spanning trees, Combinatorica, 5 (1985), pp.57–65.(Also in FOCS 1984.)

    Google Scholar 

  6. B. Schieber and U.Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17 (1988), pp. 11253–1262.

    Article  Google Scholar 

  7. R. Tarjan. Applications of path compressions on balanced trees, J.Assoc. Comput. Mach. 26(1979), pp.690–715.

    Google Scholar 

  8. R. Tarjan. Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Math. vol. 44, SIAM (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Victoria, V8W 3P6, Victoria, BC, Canada

    Valerie King

Authors
  1. Valerie King
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Selim G. Akl Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

King, V. (1995). A simpler minimum spanning tree verification algorithm. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_83

Download citation

  • DOI: https://doi.org/10.1007/3-540-60220-8_83

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60220-0

  • Online ISBN: 978-3-540-44747-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation