Susan L. Spraragen
International Conference on Design and Emotion 2010
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
Hong-linh Truong, Maja Vukovic, et al.
ICDH 2024
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence