Advertisement

Offline algorithms for dynamic minimum spanning tree problems

  • David Eppstein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 519)

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(log2n) work per modification. No previous dynamic geometric MST algorithm was known.

Keywords

Minimum Span Tree Edge Weight Mixed Problem Geometric Point Graph Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    F. Chin and D. Houck. Algorithms for updating minimum spanning trees. J. Comput. Syst. Sci. 16 (1978) 333–344.Google Scholar
  2. [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. [3]
    D. Eppstein. Persistence, offline algorithms, and space compaction. Manuscript, 1991.Google Scholar
  4. [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. [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. [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. [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. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • David Eppstein
    • 1
  1. 1.Department of Information and Computer ScienceUniversity of CaliforniaIrvine

Personalised recommendations