Distance-2-dispersion with termination by a strong team

DOI10.1007/978-3-031-52213-0_4MaRDI QIDQ6547820zbMATH OpenFDO

Authors Barun Gorain, Tanvir Kaur, Kaushik Mondal

Publication date 31 May 2024

zbMATH Keywords

dispersiondeterministic algorithmdistributed algorithmmobile robotsdistance-2-dispersion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• Dispersion of mobile robots on grids
• Dispersion of mobile robots: the power of randomness
• Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots
• Efficient Dispersion of Mobile Agents without Global Knowledge
• Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
• Fast dispersion of mobile robots on arbitrary graphs
• Memory optimal dispersion by anonymous mobile robots
• Near-optimal dispersion on arbitrary anonymous graphs
• Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
• Uniform multi-agent deployment on a ring

This page was built for publication: Distance-2-dispersion with termination by a strong team

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