Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds

DOI10.1007/978-3-319-57586-5_21zbMath1486.68129OpenAlexW2606892031MaRDI QIDQ5283371

No author found.

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_21

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Token Swapping on Trees ⋮ Reconfiguration of connected graph partitions

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• The \((n^ 2-1)\)-puzzle and related relocation problems
• Graph puzzles, homotopy, and the alternating group
• Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard

This page was built for publication: Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds