A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem

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 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.

Mots clés: Minimum diameter spanning trees; All-pairs shortest paths; Absolute centers; Shortest path trees

Domaines: Combinatoire [math.CO]; Calcul parallèle, distribué et partagé [cs.DC]

Franck Butelle, Christian Lavault. A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem. 2nd International Conference On Principles Of Distributed Systems (OPODIS'98), Dec 1998, Amiens, France. pp.77-88. ⟨hal-00465670⟩