, Volume 22, Issue 3, pp 275–304 | Cite as

Maintaining Spanning Trees of Small Diameter

  • G. F. Italiano
  • R. Ramaswami


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.

Key words. Design and analysis of algorithms and data structures, Spanning trees. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© 1998 Springer-Verlag New York Inc.

Authors and Affiliations

  • G. F. Italiano
    • 2
  • R. Ramaswami
    • 1
  1. 1.IBM Research Division, Thomas J. Watson Research Center, Yorktown Heights, NY 10598, USA.US
  2. 2.Current address: Dipartimento di Informatica e Sistemistica, Universitá di Roma ``La Sapienza,'' Rome, Italy.IT

Personalised recommendations