A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Paper
Maintaining spanning trees of small diameter
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. © 1998 Springer-Verlag New York Inc.
Related
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Conference paper
Optimization of real phase-mask performance
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991