A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem
Butelle, Franck ; Lavault, Christian
HAL, hal-00465670 / Harvested from HAL
Text on HAL
We present a new algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of any arbitrary positively real-weighted graph. We use a new fast linear time intermediate all-pairs shortest paths routing protocol. The resulting distributed algorithm is asynchronous, it works for arbitrary named network, and achieves O(n) time complexity and O(nm) message complexity.
Publié le : 1998-12-16
Classification:  Minimum diameter spanning trees,  All-pairs shortest paths,  Absolute centers,  Shortest path trees,  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],  [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC] 
@article{hal-00465670,
     author = {Butelle, Franck and Lavault, Christian},
     title = {A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem},
     journal = {HAL},
     volume = {1998},
     number = {0},
     year = {1998},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00465670}
}

Butelle, Franck; Lavault, Christian. A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem. HAL, Tome 1998 (1998) no. 0, . http://gdmltest.u-ga.fr/item/hal-00465670/