Abstract
Given a graph G with m edges and n nodes, a spanning tree T of G, and an edge e that is being deleted from or inserted into G, we give efficient O(n) algorithms to compute a possible swap for e that minimizes the diameter of the new spanning tree. This problem arises in high-speed networks, particularly in optical networks.
This work was supported in part by Grant no. MDA 972-92-C-0075 from ARPA, by the ESPRIT BRA ALCOM II under contract no. 7141 and by the Italian MURST Project “Algoritmi, Modelli di Calcolo e Strutture Informative”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, I. Cidon, and S. Kutten. Communication-optimal maintenance of replicated information. Proc. 31st FOCS (1990), 492–502.
D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification — A technique for speeding up dynamic graph algorithms. Proc. 33rd FOCS (1992), 60–69.
D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 13:33–54, 1992.
G. N. Frederickson. Data structures for on-line updating of minimum spanning trees. SIAM J. Comput., 14:781–798, 1985.
G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. Proc. 32nd FOCS (1991), 632–641.
F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
R. Ramaswami. Multi-wavelength lightwave networks for computer communication. IEEE Communications Magazine, 31:78–88, 1993.
M. Rauch. Fully Dynamic Graph Algorithms and Their Data Structures. PhD Thesis, Department of Computer Science, Princeton University, December 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Italiano, G.F., Ramaswami, R. (1994). Maintaining spanning trees of small diameter. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_71
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive