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.
Cite
CITATION STYLE
APA
Italiano, G. F., & Ramaswami, R. (1994). Maintaining spanning trees of small diameter. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 820 LNCS, pp. 227–238). Springer Verlag. https://doi.org/10.1007/3-540-58201-0_71
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free