Tight bounds for undirected graph exploration with pebbles and multiple agents (Q5215469)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight bounds for undirected graph exploration with pebbles and multiple agents |
scientific article; zbMATH DE number 7165892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9404196739196776
0 references
0.8008923530578613
0 references
0.7856526970863342
0 references
0.7856011390686035
0 references
