Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 1514–1516Cite as

Parallel Connectivity and Minimum Spanning Trees

  • Reference work entry
  • First Online:

  • 112 Accesses

Years and Authors of Summarized Original Work

  • 1995; Ka Wong Chong, Lam

  • 2001; Ka Wong Chong, Han, Lam

Problem Definition

Given a weighted undirected graph G with n vertices and m edges, compute a minimum spanning tree (or spanning forest) of G on a parallel random access machine (PRAM) without concurrent write capability.

A minimum spanning tree of a graph is a spanning tree with the smallest possible sum of edge weights. The parallel random access machine (PRAM) is an abstract model for designing parallel algorithms and understanding the power of parallelism. In this model, processors (each being a random access machine) work in a synchronous manner and communicate through a shared memory. PARM can be further classified according to whether it is allowed for more than one processor to read and write into the same shared memory location simultaneously. The strongest model is CRCW (concurrent-read, concurrent-write) PRAM, and the weakest is EREW (exclusive-read, exclusive-write) PRAM....

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Chong KW, Han Y, Lam TW (2001) Concurrent threads and optical parallel minimum spanning trees algorithm. J ACM 48(2):297–323

    Article  MathSciNet  MATH  Google Scholar 

  2. Cole R, Klein PN, Tarjan RE (1996) Finding minimum spanning forests in logarithmic time and linear work using random sampling. In: Proceedings of the 8th annual ACM symposium on parallel architectures and algorithms, Padua, pp 243–250

    Google Scholar 

  3. Cole R, Vishkin U (1986) Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In: Proceedings of the 27th annual IEEE symposium on foundations of computer science, Toronto, pp 478–491

    Google Scholar 

  4. Cook SA, Dwork C, Reischuk R (1986) Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J Comput 15(1):87–97

    Article  MathSciNet  MATH  Google Scholar 

  5. JáJá J (1992) An introduction to parallel algorithms. Addison-Wesley, Boston

    MATH  Google Scholar 

  6. Johnson DB, Metaxas P (1991) Connected components in O(lg3∕2 | V | ) parallel time for the CREW PRAM. In: Proceedings of the 32nd annual IEEE symposium on foundations of computer science, San Juan, pp 688–697

    Google Scholar 

  7. Karger DR (1995) Random sampling in graph optimization problems. Ph.D. thesis, Department of computer science, Stanford University

    Google Scholar 

  8. Karp RM, Ramachandran V (1990) Parallel algorithms for shared-memory machines. In: Van Leeuwen Ed J (ed) Handbook of theoretical computer science, vol A, pp 869–941. MIT Press, Massachusetts

    Google Scholar 

  9. Pettie S, Ramachandran V (2002) An optimal minimum spanning tree algorithm. J ACM 49(1):16–34

    Article  MathSciNet  MATH  Google Scholar 

  10. Pettie S, Ramachandran V (2002) A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM J Comput 31(6):1879–1895

    Article  MathSciNet  MATH  Google Scholar 

  11. Poon CK, Ramachandran V (2003) A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest. Algorithmica 35(3):257–268

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hong Kong, Chow Yei Ching Building, Pokfulam Road, Hong Kong, China

    Tak-Wah Lam

Authors
  1. Tak-Wah Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tak-Wah Lam .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Lam, TW. (2016). Parallel Connectivity and Minimum Spanning Trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_280

Download citation

Publish with us

Policies and ethics

Search

Navigation