Quiescence of self-stabilizing gossiping among mobile agents in graphs

DOI10.1016/j.tcs.2010.01.006zbMath1191.68730OpenAlexW2135476437MaRDI QIDQ962163

Sébastien Tixeuil, Toshimitsu Masuzawa

Publication date: 6 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.6346

zbMATH Keywords

gossipingdistributed algorithmsagentsself-stabilizationquiescence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)

Related Items (1)

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

Cites Work

• Stabilizing leader election in partial synchronous systems with crash failures
• Rendezvous and election of mobile agents: Impact of sense of direction
• An annotated bibliography on guaranteed graph searching
• Memory requirements for silent stabilization
• Move-optimal gossiping among mobile agents
• Deterministic rendezvous in graphs
• Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
• Deterministic Rendezvous in Trees with Little Memory
• How to Meet in Anonymous Network
• Searching for a black hole in arbitrary networks
• Mathematical Foundations of Computer Science 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quiescence of self-stabilizing gossiping among mobile agents in graphs