Shifting Graphs and Their Applications
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 Association for Computing Machinery
Pippenger, N. and Valiant, L.G. "Shifting Graphs and Their Applications", J. ACM, 23 (1976), 423-432. doi: 10.1145/321958.321962