Skip to main content
SpringerLink
Log in

Optimal parallel verification of minimum spanning trees in logarithmic time

  • Conference paper
  • First Online:
Parallel and Distributed Computing Theory and Practice (CFCP 1994)

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

Included in the following conference series:

Abstract

We have presented algorithms for verification and sensitivity analysis of minimum spanning trees. Both algorithms are optimal; however, the exact bound on the number of processors for deterministic sensitivity analysis is not known. This leaves the obvious open question from the Dixon, Rauch and Tarjan paper: “What is the best bound on the number of comparisons needed to perform sensitivity analysis?” The algorithms given here are for the CREW PRAM model. Can these algorithms be transformed into an EREW algorithm?

A very interesting question now is whether the new result of Klein and Tarjan

Research partially supported by a National Science Foundation Graduate Fellowship and by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center. Grant No. NSF-STC88-09648.

Research at Princeton University partially supported by the National Science Foundation. Grant No. CCR-8920505, the Office of Naval Research. Contract No. N00014-91-J-1463. and by DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center, Grant No. NSF-STC88-09648.

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. N. Alon and B. Schieber Optimal preprocessing for answering on-line product queries, Unpublished manuscript

    Google Scholar 

  2. B. Awerbuch and Y. Shiloach, New connectivity and MSF algorithms for shuffle-exchange network and PRAM, IEEE Trans. on Computers, Vol. C-36, No. 10, Oct. 1987, pp. 1258–1263

    Google Scholar 

  3. H. Booth and J. Westbrook, Linear Algorithms for Analysis of Minimum Spanning and Shortest Path Trees in Planar Graphs, Yale University, Department of Computer Science, TR-768, Feb. 1990.

    Google Scholar 

  4. B. D. Dixon, M. Rauch, and R. E. Tarjan, Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time, SIAM J. Comput. 21(6) (1992) pp. 1184–1192.

    Google Scholar 

  5. H.N. Gabow, Z. Galil, T. Spencer, and R.E. Tarjan, Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs, Combinatorica 6(2) (1986) pp. 109–122.

    Google Scholar 

  6. D. Harel and R.E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM J. Comput. 13(2) (1984) pp. 338–355.

    Google Scholar 

  7. P. Klein and R.E. Tarjan, A Randomized Linear Time Algorithm for Finding Minimum Spanning Trees, Personal comunication.

    Google Scholar 

  8. D. B. Johnson and P. Metaxas, A parallel algorithm for computing minimum spanning trees, 4th ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 363–372.

    Google Scholar 

  9. R. Karp and V. Ramachandran, Parallel Algorithms for Shared Memory Machines, Handbook of Theoretical Computer Science (1990) Chapter 17.

    Google Scholar 

  10. J. H. Reif, An Optimal parallel algorithm for integer sorting, Proc. STOC 26 (1985) 496–504.

    Google Scholar 

  11. B. Schieber and U. Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization, SIAM J. Comput. 17(6) (1988) pp. 1253–1262.

    Google Scholar 

  12. R.E. Tarjan, Applications of Path Compressions on Balanced Trees, J. Assoc. Comput. Mach. 26(4) (1979) pp. 690–715.

    Google Scholar 

  13. R.E. Tarjan, Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees, Information Processing Letters 14(1) (1982) pp. 30–33. Corrigendum, Ibid 23 (1986), p.219.

    Google Scholar 

  14. R.E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Washington and Lee University, 24450, Lexington, VA

    Brandon Dixon

  2. NEC Research Institute, 08540, Princeton, New Jersey

    Brandon Dixon & Robert E. Tkrjan

Authors
  1. Brandon Dixon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert E. Tkrjan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Cosnard Afonso Ferreira Joseph Peters

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dixon, B., Tkrjan, R.E. (1994). Optimal parallel verification of minimum spanning trees in logarithmic time. In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-58078-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58078-2

  • Online ISBN: 978-3-540-48435-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation