Beyond rings: gathering in 1-interval connected graphs

DOI10.1142/S0129626421500201zbMATH Open1490.68050OpenAlexW3211862663MaRDI QIDQ5087065FDOQ5087065

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

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

zbMATH Keywords

gatheringunicyclic graphsmobile agentsdynamic graphsweak gathering

Mathematics Subject Classification ID

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

Cites Work

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

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)