Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks

DOI10.1007/978-3-540-77444-0_28MaRDI QIDQ5445768zbMATH OpenOpenAlexFDO

Authors Ahmed Hadj Kacem, Mohamed Mosbah, Mohamed Jmaiel, Mohamed Haddar, Yves Métivier

Publication date 6 March 2008

Published in Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77444-0_28

zbMATH Keywords

distributed algorithmsmobile agentsproofsspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
• A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
• Randomized Lower Bound for Distributed Spanning-Tree Verification
• Linear time and space gathering of anonymous mobile agents in asynchronous trees
• The verified incremental design of a distributed spanning tree algorithm: Extended abstract
• Distributed verification of minimum spanning trees
• Distributed verification of minimum spanning trees
• A Distributed Algorithm for Proportional Task Allocation in Networks of Mobile Agents

Cited in

(5)

• A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
• Distributed graph searching with a sense of direction
• Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
• A structured methodology for designing distributed algorithms for mobile entities
• How much memory is needed for leader election

This page was built for publication: Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks

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