Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
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.
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Yale Song, Zhen Wen, et al.
IJCAI 2013
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
Arthur Nádas
IEEE Transactions on Neural Networks