Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
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.
Imran Nasim, Melanie Weber
SCML 2024
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Minghong Fang, Zifan Zhang, et al.
CCS 2024
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ