1.
Nebel B. On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs. ICAPS [Internet]. 2020Jun.1 [cited 2021Feb.25];30(1):212-6. Available from: https://ojs.aaai.org/index.php/ICAPS/article/view/6663