"On the Complexity of Optimal Parallel Cooperative Path-Finding."

Pavel Surynek (2015)

> Home

Details and statistics

DOI: 10.3233/FI-2015-1192

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fuin/Surynek15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/Surynek15
Pavel Surynek:
On the Complexity of Optimal Parallel Cooperative Path-Finding. Fundam. Informaticae 137(4): 517-548 (2015)

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.