Rama Akkiraju, Pinar Keskinocak, et al.
Applied Intelligence
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
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Harsha Kokel, Aamod Khatiwada, et al.
VLDB 2025
Conference paper
Program equivalence and context-free grammars
Barry K. Rosen
SWAT 1972