Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Optimal parallel verification of minimum spanning trees in logarithmic time

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We present the first optimal parallel algorithms for the verification and sensitivity analysis of minimum spanning trees. Our algorithms are deterministic and run inO(logn) time and require linear-work in the CREW PRAM model. These algorithms are used as a subroutine in the linear-work randomized algorithm for finding minimum spanning trees of Cole, Klein, and Tarjan.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Alon and B. Schieber, Optimal Preprocessing for Answering On-Line Product Queries, Unpublished manuscript.

  2. B. Awerbuch and Y. Shiloach, New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM,IEEE Trans. Comput. 36(10) (1987), 1258–1263.

    MATH  MathSciNet  Google Scholar 

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

  4. R. Cole, P. Klein, and R. E. Tarjan, A Linear-work Parallel Algorithm for Finding Minimum Spanning Trees,Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, 1994.

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

    Article  MATH  MathSciNet  Google Scholar 

  6. 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), 109–122.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. D. B. Johnson and P. Metaxas, A Parallel Algorithm for Computing Minimum Spanning Trees,Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, 1992, pp. 363–372.

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

    Google Scholar 

  10. V. King, A Simpler Minimum Spanning Tree Verification Algorithm, Manuscript, 1994.

  11. P. Klein and R. E. Tarjan, A Randomized Linear Time Algorithm for Finding Minimum Spanning Trees,Proc. 26th Annual ACM Symp. on Theory of Computing, 1994.

  12. J. H. Reif, An Optimal Parallel Algorithm for Integer Sorting,Proc. 26th Annual ACM Symp. on Foundations of Computer Science, 1985, pp. 496–504.

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

    MATH  MathSciNet  Google Scholar 

  14. R. E. Tarjan, Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees,Inform. Process. Lett. 14(1) (1982), 30–33. Corrigendum, ibid. Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees,Inform. Process. Lett. 23 (1986), 219.

    Article  MathSciNet  Google Scholar 

  15. 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, University of Alabama, 35487-0207, Tuscaloosa, AL, USA

    B. Dixon

  2. Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA

    R. E. Tarjan

  3. NEC Research Institute, 08540, Princeton, NJ, USA

    R. E. Tarjan

Authors
  1. B. Dixon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. E. Tarjan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by A. C.-C. Yao.

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 was 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.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dixon, B., Tarjan, R.E. Optimal parallel verification of minimum spanning trees in logarithmic time. Algorithmica 17, 11–18 (1997). https://doi.org/10.1007/BF02523235

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02523235

Key words

Search

Navigation