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
Jianke Yang, Robin Walters, et al.
ICML 2023
M. Tismenetsky
International Journal of Computer Mathematics
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004