Skip to main content
SpringerLink
Log in

Offline algorithms for dynamic minimum spanning tree problems

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1991)

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

Included in the following conference series:

Abstract

We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm performs O(log n) work per modification, where n is the number of vertices in the graph. We use our techniques to solve the offline geometric MST problem for a planar point set subject to insertions and deletions; our algorithm for this problem performs O(log2 n) work per modification. No previous dynamic geometric MST algorithm was known.

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. F. Chin and D. Houck. Algorithms for updating minimum spanning trees. J. Comput. Syst. Sci. 16 (1978) 333–344.

    Google Scholar 

  2. D. Eppstein. Finding the k smallest spanning trees. Proc. 2nd Scand. Worksh. Algorithm Theory, Springer-Verlag LNCS 447 (1990) 38–47.

    Google Scholar 

  3. D. Eppstein. Persistence, offline algorithms, and space compaction. Manuscript, 1991.

    Google Scholar 

  4. D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic planar graph. Proc. 1st ACM/SIAM Symp. Discrete Algorithms (1990) 1–11.

    Google Scholar 

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

    Google Scholar 

  6. M.L. Fredman and D.E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Proc. 31st IEEE Symp. Found. Computer Science (1990) 719–725.

    Google Scholar 

  7. H.N. Gabow, Z. Galil, T. Spencer, and R. Tarjan. Efficient algorithsms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6 (1986) 109–122.

    Google Scholar 

  8. H.N. Gabow and M. Stallman. Efficient algorithms for graphic matroid intersection and parity. Proc. 12th Int. Conf. Automata, Languages, and Programming, Springer-Verlag LNCS 194 (1985) 210–220.

    Google Scholar 

  9. P.M. Spira and A. Pan. On finding and updating spanning trees and shortest paths. SIAM J. Comput. 4 (1975) 375–380.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Science, University of California, 92717, Irvine, CA

    David Eppstein

Authors
  1. David Eppstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eppstein, D. (1991). Offline algorithms for dynamic minimum spanning tree problems. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028278

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54343-5

  • Online ISBN: 978-3-540-47566-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation