Skip to Main content Skip to Navigation
Journal articles

A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree

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 $\mathcal{O}(|V|)$ time complexity and $\mathcal{O}\left(|V|\,|E|\right)$
Complete list of metadatas


https://hal.archives-ouvertes.fr/hal-00915195
Contributor : Christian Lavault <>
Submitted on : Friday, December 6, 2013 - 5:04:27 PM
Last modification on : Friday, September 18, 2020 - 2:34:56 PM
Long-term archiving on: : Saturday, April 8, 2017 - 5:19:23 AM

Files

mdst04.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00915195, version 1
  • ARXIV : 1312.1961

Citation

Marc Bui, Franck Butelle, Christian Lavault. A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree. Journal of Parallel and Distributed Computing, Elsevier, 2004, 64 (5), pp.571--577. ⟨hal-00915195⟩

Share

Metrics

Record views

470

Files downloads

460