Hannah Kim, Celia Cintas, et al.
IJCAI 2023
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.
Hannah Kim, Celia Cintas, et al.
IJCAI 2023
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Arthur Nádas
IEEE Transactions on Neural Networks
Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst