The computational complexity of multi-agent pathfinding on directed graphs

Artificial Intelligence 328 (C):104063 (2024)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,795

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The complexity of searching implicit graphs.JoséL Balcázar - 1996 - Artificial Intelligence 86 (1):171-188.
Optimal query complexity bounds for finding graphs.Sung-Soon Choi & Jeong Han Kim - 2010 - Artificial Intelligence 174 (9-10):551-569.

Analytics

Added to PP
2024-01-09

Downloads
16 (#1,202,268)

6 months
7 (#740,041)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Will Mathematics Ultimately Describe Nature?James R. Johnson - 2019 - Философия И Космология 23:22-29.

Add more references