R. Sebastian, M. Weise, et al.
ECPPM 2022
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.
R. Sebastian, M. Weise, et al.
ECPPM 2022
Susan L. Spraragen
International Conference on Design and Emotion 2010
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999
George Saon
SLT 2014