Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
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.
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control