Zero-memory graph exploration with unknown inports (Q6148067): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Label-guided graph exploration by a finite automaton / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Memory Efficient Anonymous Graph Exploration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Time and space optimality of rotor-router graph exploration / rank | |||
Normal rank | |||
Latest revision as of 16:05, 22 August 2024
scientific article; zbMATH DE number 7786522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Zero-memory graph exploration with unknown inports |
scientific article; zbMATH DE number 7786522 |
Statements
Zero-memory graph exploration with unknown inports (English)
0 references
11 January 2024
0 references
graph exploration
0 references
mobile agents
0 references
zero memory
0 references
