Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles

DOI10.1007/978-3-031-21017-4_2zbMath1522.68425MaRDI QIDQ6155234

Kohei Shimoyama, Toshimitsu Masuzawa, Yuichi Sudo, Hirotsugu Kakugawa

Publication date: 12 June 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

mobile agentcactus graphsnap-stabilizationgraph exploration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• More efficient periodic traversal in anonymous undirected graphs
• Fast periodic graph exploration with constant memory
• Setting port numbers for fast graph exploration
• Quiescence of self-stabilizing gossiping among mobile agents in graphs
• A distributed ant algorithm for efficiently patrolling a network
• Snap-stabilization and PIF in tree networks
• Time and space optimality of rotor-router graph exploration
• Graph decomposition for memoryless periodic exploration
• Graph exploration by a finite automaton
• Decontamination of hypercubes by mobile agents
• Tree exploration with logarithmic memory
• OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
• Undirected connectivity in log-space
• Self-stabilizing systems in spite of distributed control
• Tree exploration with little memory
• Exploring Unknown Undirected Graphs
• Label-guided graph exploration by a finite automaton
• Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
• Introduction to Distributed Self-Stabilizing Algorithms
• Structural Information and Communication Complexity
• Structural Information and Communication Complexity

This page was built for publication: Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles