Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
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
Bemali Wickramanayake, Zhipeng He, et al.
Knowledge-Based Systems
Kellen Cheng, Anna Lisa Gentile, et al.
EMNLP 2024
Rama Akkiraju, Pinar Keskinocak, et al.
Applied Intelligence