Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents (Q5215469): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2980598507 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1805.03476 / rank | |||
Normal rank | |||
Latest revision as of 23:54, 19 April 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
