A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
2017
RAIRO - Theoretical Informatics and Applications
The problem of constructing and maintaining a spanning tree in dynamic networks is important in distributed systems. Trees are essential structures in various communication protocols such as information broadcasting, routing, etc. In a distributed computing environment, the solution of this problem has many practical motivations. To make designing distributed algorithm easier, we model this latter with a local computation model. Based on the mobile agent paradigm, we present in this paper a
doi:10.1051/ita/2017007
fatcat:c7w3rkgkjzaehpuf2wahkt7hfm