William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
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. © 1998 Springer-Verlag New York Inc.
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Sankar Basu
Journal of the Franklin Institute
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Leo Liberti, James Ostrowski
Journal of Global Optimization