A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem

Marc Bui , Franck Butelle (1) , Christian Lavault (1)

1 LIPN - Laboratoire d'Informatique de Paris-Nord

We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G=(V,E,\omega). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(|V|) time complexity and O(|V| |E|) message complexity.

Mots clés: Systèmes distribués et parallèles; Informatique théorique (algorithmique)

Domaines: Informatique

Marc Bui, Franck Butelle, Christian Lavault. A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem. Journal of Parallel and Distributed Computing, 2004, 64, pp.571--577. ⟨hal-00082535⟩