Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents.
| Autor: | DISSER, YANN1 disser@mathematik.tu-darmstadt.de, HACKFELD, JAN2 jan.hackfeld@hu-berlin.de, KLIMM, MAX2 max.klimm@hu-berlin.de |
|---|---|
| Zdroj: | Journal of the ACM. Oct2019, Vol. 66 Issue 6, p1-41. 41p. |
| Databáze: | Business Source Ultimate |
| Externí odkaz: |
|