Self-stabilizing rendezvous of synchronous mobile agents in graphs

DOI10.1007/978-3-319-69084-1_2MaRDI QIDQ5045430zbMATH OpenOpenAlexFDO

Authors Fukuhito Ooshita, Ajoy K. Datta, Toshimitsu Masuzawa

Publication date 4 November 2022

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

Full work available at URL https://doi.org/10.1007/978-3-319-69084-1_2

zbMATH Keywords

gatheringmobile agentsrendezvousself-stabilization

Mathematics Subject Classification ID

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

Recommendations

• Deterministic rendezvous in graphs
• Algorithms and Computation
• Deterministic rendezvous in graphs
• Asynchronous deterministic rendezvous in graphs
• Mathematical Foundations of Computer Science 2005

Cited in

(6)

• Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
• scientific article; zbMATH DE number 2036576 (Why is no real title available?)
• Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
• Self-stabilizing graph exploration by a single agent
• Quiescence of self-stabilizing gossiping among mobile agents in graphs

This page was built for publication: Self-stabilizing rendezvous of synchronous mobile agents in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045430)