Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
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.
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022