Skip to Main content Skip to Navigation
Conference papers

A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem

Abstract : 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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00465670
Contributor : Christian Lavault <>
Submitted on : Monday, April 5, 2010 - 11:17:34 AM
Last modification on : Saturday, February 15, 2020 - 1:58:15 AM
Long-term archiving on: : Tuesday, September 14, 2010 - 5:32:27 PM

File

mdst98.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00465670, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

323

Files downloads

186