Return to search

Solving multi-agent pathfinding problems in polynomial time using tree decompositions

No description available.

Identifer	oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:AEU.uuid#03ee1be0-055e-4c4a-b2dc-b8440bafe734
Creators	Khorshid, Mokhtar
Publisher	University of Alberta
Source Sets	Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
Language	English
Detected Language	English
Type	Thesis
Format	application/pdf