Skip to main content
SpringerLink
Log in

Minimizing diameters of dynamic trees

  • Session 5: Algorithms I
  • 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

In this paper we consider an on-line problem related to minimizing the diameter of a dynamic tree T. A new edge f is added, and our task is to delete the edge e of the induced cycle so as to minimize the diameter of the resulting tree TU {f}{e}. Starting with a tree with n nodes, we show how each such best swap can be found in worst-case O(log2 n) time. The problem was raised by Italiano and Ramaswami at ICALP'94 together with a related problem for edge deletions. Italiano and Ramaswami solved both problems in O(n) time per operation.

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. Z-Z. Chen. A simple parallel algorithm for computing the diameters of all vertices in a tree and its application. Information Processing Letters, 42:243–248, 1992.

    Article  Google Scholar 

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

    Google Scholar 

  3. G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 632–641, 1991.

    Google Scholar 

  4. G.Y. Handler. Minimax location of a facility in an undirected tree network. Transportation. Sci., 7:287–293, 1973.

    Google Scholar 

  5. G. F. Italiano and R. Ramaswami. Mantaining spanning trees of small diameter. In Proc. 21st Int. Coll. on Automata, Languages and Programming. Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994.

    Google Scholar 

  6. G. F. Italiano and R. Ramaswami. Mantaining spanning trees of small diameter. Unpublished revised version of the ICALP paper, 1996.

    Google Scholar 

  7. R. Ramaswami. Multi-wavelength lightwave networks for computer communication. IEEE Communications Magazine, 31:78–88, 1993.

    Article  Google Scholar 

  8. M. Rauch. Fully dynamic graph algorithms and their data structures. PhD thesis, Department of computer science, Princeton University, December 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen, Denmark

    Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg & Mikkel Thorup

Authors
  1. Stephen Alstrup
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacob Holm
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kristian de Lichtenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mikkel Thorup
    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

Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M. (1997). Minimizing diameters of dynamic trees. 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_184

Download citation

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

  • 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