Nebel, B. “On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphs”. Proceedings of the International Conference on Automated Planning and Scheduling, vol. 30, no. 1, June 2020, pp. 212-6, https://ojs.aaai.org/index.php/ICAPS/article/view/6663.