1.9k citations · 2k across the 8 of their papers we have counts for
1 paper · 1 filter
Bernhard Nebel
The determination of the computational complexity of multi-agent pathfinding on directed graphs has been an open problem for many years. For undirected graphs, solvability can be d…