Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |

GRUNER_2001-DistributedAlgorithm

Stefan Gruner, Yves Métivier, Mohamed Mosbah, Pierre-André Wacrenier. Distributed Algorithm for Computing a Spanning Tree in Anonymous T-prime Graphs. In OPODIS'2001, International Conference On Principles of DIstributed Systems, Manzanillo, Mexico, December 2001.

Download

Download paper: Gziped Postscript

Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

We describe a distributed algorithm for computing spanning trees in anonymous networks. The processors communicate with their neighbours by asynchronous message passing. The algorithm is correct and terminates for networks belonging to the class of T-prime graphs. We also present some experimental results concerning the complexity of our algorithm.

Contact

Stefan Gruner
Yves Métivier
Mohamed Mosbah
Pierre-André Wacrenier

BibTex Reference

@InProceedings{GRUNER_2001-DistributedAlgorithm,
   Author = {Gruner, Stefan and Métivier, Yves and Mosbah, Mohamed and Wacrenier, Pierre-André},
   Title = {Distributed Algorithm for Computing a Spanning Tree in Anonymous T-prime Graphs},
   BookTitle = {OPODIS'2001, International Conference On Principles of DIstributed Systems},
   Address = {Manzanillo, Mexico},
   Month = {December},
   Year = {2001}
}

EndNote Reference [help]

Get EndNote Reference (.ref)