Skip to main content
SpringerLink
Log in

Maintaining Spanning Trees of Small Diameter

  • Published:
Algorithmica Aims and scope Submit manuscript

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 is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. IBM Research Division, Thomas J. Watson Research Center, Yorktown Heights, NY 10598, USA., , , , , , US

    R. Ramaswami

  2. Current address: Dipartimento di Informatica e Sistemistica, Universitá di Roma ``La Sapienza,'' Rome, Italy., , , , , , IT

    G. F. Italiano

Authors
  1. G. F. Italiano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Ramaswami
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received January 1995; revised February 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Italiano, G., Ramaswami, R. Maintaining Spanning Trees of Small Diameter . Algorithmica 22, 275–304 (1998). https://doi.org/10.1007/PL00009225

Download citation

  • Issue Date:

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

Search

Navigation