Self-stabilizing graph exploration by a single agent
From MaRDI portal
Cites work
- A distributed ant algorithm for efficiently patrolling a network
- A Snap-Stabilizing DFS with a Lower Space Requirement
- Covering problems for Markov chains
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs
- Efficient Dispersion of Mobile Agents without Global Knowledge
- Exploration of dynamic cactuses with sub-logarithmic overhead
- Exploration of dynamic tori by multiple agents
- Exploring Unknown Undirected Graphs
- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
- Gathering despite mischief
- Gathering in dynamic rings
- scientific article; zbMATH DE number 3784244 (Why is no real title available?)
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles
- Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
- Near-optimal dispersion on arbitrary anonymous graphs
- Quiescence of self-stabilizing gossiping among mobile agents in graphs
- Self-stabilizing depth-first token circulation in arbitrary rooted networks
- Self-stabilizing depth-first token circulation on networks
- Self-stabilizing rendezvous of synchronous mobile agents in graphs
- The hitting and cover times of random walks on finite graphs using local degree information
- Undirected connectivity in log-space
- Universal traversal sequences with backtracking.
- Want to gather? No need to chatter!
This page was built for publication: Self-stabilizing graph exploration by a single agent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316933)
