Pages that link to "Item:Q2429354"
From MaRDI portal
The following pages link to Graph decomposition for memoryless periodic exploration (Q2429354):
Displaying 7 items.
- Explore and repair graphs with black holes using mobile entities (Q888441) (← links)
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane (Q1627966) (← links)
- Bamboo garden trimming problem: priority schedulings (Q2003325) (← links)
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? (Q2835014) (← links)
- Efficient grid exploration with a stationary token (Q2929616) (← links)
- Exploration of Time-Varying Connected Graphs with Silent Agents (Q5100956) (← links)
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles (Q6155234) (← links)