%0 Conference Proceedings %F GRUNER_2001-DistributedAlgorithm %A Gruner, Stefan %A Métivier, Yves %A Mosbah, Mohamed %A Wacrenier, Pierre-André %T Distributed Algorithm for Computing a Spanning Tree in Anonymous T-prime Graphs %B OPODIS'2001, International Conference On Principles of DIstributed Systems %C Manzanillo, Mexico %X 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. %U ../../articles/spanning.ps.gz %8 December %D 2001