Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents (Q5215469): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:31, 8 February 2024
scientific article; zbMATH DE number 7165892
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents |
scientific article; zbMATH DE number 7165892 |
Statements
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents (English)
0 references
11 February 2020
0 references
graph exploration
0 references
multi-agent system
0 references
pebbles
0 references
space efficiency
0 references
