Skip to Main content Skip to Navigation
Journal articles

A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
Contributor : Franck Butelle <>
Submitted on : Wednesday, June 28, 2006 - 1:56:53 PM
Last modification on : Saturday, February 15, 2020 - 1:51:12 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:30:28 PM


  • HAL Id : hal-00082535, version 1



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



Record views


Files downloads