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.

Maintaining spanning trees of small diameter / Italiano, G; Ramaswami, R.. - In: ALGORITHMICA. - ISSN 0178-4617. - 22:(1998), pp. 275-304.

Maintaining spanning trees of small diameter

ITALIANO G;
1998

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.
Design and analysis of algorithms and data structures, Spanning trees
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11385/199835
Citazioni
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 11
social impact