Beyond rings: gathering in 1-interval connected graphs

DOI10.1142/S0129626421500201MaRDI QIDQ5087065zbMATH OpenOpenAlexFDO

Authors Othon Michail, Michail Theofilatos, P. G. Spirakis

Publication date 8 July 2022

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626421500201

zbMATH Keywords

gatheringunicyclic graphsmobile agentsdynamic graphsweak gathering

Mathematics Subject Classification ID

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

Recommendations

• Gathering in dynamic rings
• Gathering in dynamic rings
• Partial Gathering of Mobile Agents in Dynamic Rings
• Anonymous Meeting in Networks
• Gathering asynchronous oblivious agents with local vision in regular bipartite graphs

Cites work

• scientific article; zbMATH DE number 1303571 (Why is no real title available?)
• Asynchronous deterministic rendezvous in graphs
• Causality, influence, and computation in possibly disconnected synchronous dynamic networks
• Deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• Distributed computation in dynamic networks
• Distributed exploration of dynamic rings
• Exploration of dynamic networks: tight bounds on the number of agents
• Exploration of dynamic tori by multiple agents
• Gathering in dynamic rings
• Gathering of robots in a grid with mobile faults
• How to meet asynchronously (almost) everywhere
• Map construction of unknown graphs by multiple agents
• Mobile agents in distributed computing: network exploration
• Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
• Rendezvous and election of mobile agents: Impact of sense of direction
• Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
• Structural Information and Communication Complexity
• The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring

Cited in

(3)

• Gathering in dynamic rings
• Gathering on rings under the look-compute-move model
• A unified approach for gathering and exclusive searching on rings under weak assumptions

This page was built for publication: Beyond rings: gathering in 1-interval connected graphs

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