Skip to main content
SpringerLink
Log in

Maintaining minimum spanning trees in dynamic graphs

  • Session 15: Algorithms III
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1997)

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

Included in the following conference series:

Abstract

We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per update, with O(1) worst case time per query.

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. T. Corman, C. Leiserson, and Rivest. Introduction to Algorithms. MIT Press (1989), p. 381–399.

    Google Scholar 

  2. D. Eppstein, “Dynamic Euclidean minimum spanning trees and extrema of binary functions”, Disc. Comp. Geom. 13 (1995), 111–122.

    Google Scholar 

  3. D. Eppstein, Z. Galil, G. F. Italiano, “Improved Sparsification”, Tech. Report 93-20, Department of Information and Computer Science, University of California, Irvine, CA 92717.

    Google Scholar 

  4. D. Eppstein, Z. Galil, G. F. Italiano, A. Nissenzweig, “Sparsification — A Technique for Speeding up Dynamic Graph Algorithms” Proc. 33rd Symp. on Foundations of Computer Science, 1992, 60–69.

    Google Scholar 

  5. S. Even and Y. Shiloach, “An On-Line Edge-Deletion Problem”, J. ACM 28 (1981), 1–4.

    Article  Google Scholar 

  6. T. Feder and M. Mihail, “Balanced matroids”, Proc. 24th A Cm Symp. on Theory of Computing, 1992, 26–38.

    Google Scholar 

  7. G. N. Frederickson, “Data Structures for On-line Updating of Minimum Spanning Trees”, SIAM J. Comput., 14 (1985), 781–798.

    Google Scholar 

  8. G. N. Frederickson and M. A. Srinivas, “Algorithms and data structures for an expanded family of matroid intersection problems”, SIAM J. Corn-put. 18 (1989), 112–138.

    Article  Google Scholar 

  9. M. R. Henzinger and V. King. Randomized Dynamic Graph Algorithms with Polylogarithmic Time per Operation. Proc. 27th ACM Symp. on Theory of Computing, 1995, 519–527.

    Google Scholar 

  10. M. R. Henzinger and M. Thorup. Improved Sampling with Applications to Dynamic Graph Algorithms. To appear in Proc. 23rd International Colloquium on Automata, Languages, and Programming (ICALP), LNCS 1099, Springer-Verlag, 1996.

    Google Scholar 

  11. K. Mehlhorn. “Data Structures and Algorithms 1: Sorting and Searching”, Springer-Verlag, 1984.

    Google Scholar 

  12. H. Nagamochi and T. Ibaraki, “Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph”, Algorithmica 7, 1992, 583–596.

    Article  Google Scholar 

  13. D. D. Sleator, R. E. Tarjan, “A data structure for dynamic trees” J. Comput. System Sci. 24, 1983, 362–381.

    Article  Google Scholar 

  14. R. E. Tarjan, Data Structures and Network Flow, SIAM (1983) p. 71.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Systems Research Center, Digital Equipment Corporation, 130 Lytton Ave, 94301, Palo Alto, CA, USA

    Monika R. Henzinger

  2. Dept. of Computer Science, University of Victoria, P.O. Box 3055, V8W 3P6, Victoria, BC., Canada

    Valerie King

Authors
  1. Monika R. Henzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valerie King
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Henzinger, M.R., King, V. (1997). Maintaining minimum spanning trees in dynamic graphs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_214

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_214

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation