Wooseok Choi, Tommaso Stecconi, et al.
Advanced Science
Paper
Shifting Graphs and Their Applications
Abstract
Graphs that in a certain precise sense are rich in sets of vertex-disjoint paths are studied. Bounds are obtained on the minimum number of edges in such graphs, and these are used to deduce nonlinear lower bounds on the computational complexity of shifting, merging, and matching problems. © 1976, ACM. All rights reserved.
Related
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025