Victor Akinwande, Megan Macgregor, et al.
IJCAI 2024
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.
Victor Akinwande, Megan Macgregor, et al.
IJCAI 2024
George Saon
SLT 2014
Amy Lin, Sujit Roy, et al.
AGU 2024
Susan L. Spraragen
International Conference on Design and Emotion 2010