Skip to main content
SpringerLink
Log in

An o(n) work EREW parallel algorithm for updating MST

  • Conference paper
  • First Online:
Algorithms — ESA '94 (ESA 1994)

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

Included in the following conference series:

Abstract

We provide an o(m)-work EREW PRAM algorithm to maintain the minimum spanning forest of an undirected graph under edge insertions and deletions. Then, using the sparsification data structure, we improve this result obtaining the first o(n)-work EREW parallel algorithm requiring O(log n log m/n) time for each update. The problem of treating multiple edge updates is also addressed.

The first author was supported in part by Texas Advanced Technology Grant TATP-003594031. The research of P. Ferragina was carried out in part while visiting the Dept. of Computer Science, University of North Texas, Denton, with support from M.U.R.S.T. of Italy, and grant TATP-003594031.

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. M. Atallah and U. Vishkin. Finding Euler tours in parallel. Journal of computer and system sciences, 29:330–337, 1984.

    Article  MathSciNet  Google Scholar 

  2. F. Chin and D. Houck. Algorithms for updating minimum spanning trees. Journal of Computer and System Science, 16:333–344, 1978.

    MathSciNet  Google Scholar 

  3. S. K. Das and P. Ferragina. A fully-dynamic EREW parallel algorithm for updating MST. Technical Report CRPDC-94-8, Dept. of Computer Science, University of North Texas, Denton, May 1994.

    Google Scholar 

  4. D. Eppstein, Z. Galil, and G. F. Italiano. Improved sparsification. In TR 93-20. Dept. of Information and Computer Science, University of California, Irvine, 1993.

    Google Scholar 

  5. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification — a technique for speeding up Dynamic Graph Algorithms. Proc. of IEEE Symposium on Foundations of Computer Science, 60–69, 1992.

    Google Scholar 

  6. P. Ferragina and F. Luccio. Batch dynamic algorithms for two graph problems. In Proc. PARLE '94, Lecture Notes in Computer Science, to appear, 1994.

    Google Scholar 

  7. P. Ferragina. Parallel dynamic edge deletion for MST. Technical Report 8/94, Dipartimento di Informatica, Università di Pisa, Italy, June 1994.

    Google Scholar 

  8. G. N. Frederickson. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Computing, 14(4):781–798, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. N. Gabow, Z. Galil, T. H. Spencer, and R. E. Tarjan. Efficient algorithms for minimum spanning trees on directed and undirected graphs. Combinatorica, 6:109–122, 1986.

    MathSciNet  Google Scholar 

  10. J. Já Já. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.

    Google Scholar 

  11. D. B. Johnson and P. Metaxas. Optimal parallel and sequential algorithms for the vertex updating problem of a minimum spanning tree. Technical Report PCS-TR91-159, Dartmouth College, Dept. of Mathematics and Computer Science, 1991.

    Google Scholar 

  12. D. B. Johnson and P. Metaxas. A parallel algorithm for computing minimum spanning trees. In Proc. ACM Symposium on Parallel Algorithm and Architectures, pp. 363–372, 1992.

    Google Scholar 

  13. H. Jung and K. Mehlhorn. Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees. Information Processing Letters, 27(5):227–236, 1988.

    Article  MathSciNet  Google Scholar 

  14. S. Pawagi and O. Kaser. Optimal parallel algorithms for multiple updates of minimum spanning trees. Algorithmica, 9:357–382, 1993.

    Article  MathSciNet  Google Scholar 

  15. S. Pawagi and I. V. Ramakrishnan. An O(log n) algorithm for parallel update of minimum spanning trees. Information Processing Letters, 22(5):223–229, 1986.

    Article  MathSciNet  Google Scholar 

  16. A. Scháffer and P. Varman. Parallel batch update of minimum spanning trees. Technical Report COMP-TR90-140, Rice University, Houston, Texas, 1990.

    Google Scholar 

  17. X. Shen and W. Liang. A parallel algorithm for multiple edge updates of minimum spanning trees. In Proc. International Parallel Processing Symposium, 310–317, 1993.

    Google Scholar 

  18. P. Spira and A. Pan. On finding and updating spanning trees and shortest paths. SIAM Journal of Computing, 4:375–380, 1975.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of North Texas, P.O. Box 13886, 76203, Denton, TX, USA

    Sajal K. Das

  2. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Paolo Ferragina

Authors
  1. Sajal K. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo Ferragina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Das, S.K., Ferragina, P. (1994). An o(n) work EREW parallel algorithm for updating MST. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049420

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58434-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation