Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023
An orientation of an undirected graph is a choice of direction for each of its edges. An orientation is called ideal with respect to a given set of pairs of vertices if it does not increase the shortest-path distances between the members of any of the pairs. A polynomial-time algorithm is given for constructing an ideal orientation with respect to two given pairs and any positive edge-lengths, or else recognizing that no such orientation exists. Moreover, we show that this problem is in the class NC. For a general number of pairs the problem is proven NP-complete even with unit edge-lengths. © 1989.
Jianke Yang, Robin Walters, et al.
ICML 2023
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008
Y.Y. Li, K.S. Leung, et al.
J Combin Optim