Stop the war!
Остановите войну!
for scientists:
default search action
"The computational complexity of multi-agent pathfinding on directed graphs."
Bernhard Nebel (2024)
- Bernhard Nebel:
The computational complexity of multi-agent pathfinding on directed graphs. Artif. Intell. 328: 104063 (2024)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.