A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree

Marc Bui; Franck Butelle; Christian Lavault

A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree

Distributed, Parallel, and Cluster Computing 2013-12-12 v2 Data Structures and Algorithms Networking and Internet Architecture

Authors: Marc Bui , Franck Butelle , Christian Lavault

View on arXiv ↗ PDF ↗

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)$

Keywords

graph algorithms shortest path problem dynamic graph algorithms

Cite

@article{arxiv.1312.1961,
  title  = {A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree},
  author = {Marc Bui and Franck Butelle and Christian Lavault},
  journal= {arXiv preprint arXiv:1312.1961},
  year   = {2013}
}

Comments

Comments: 11 pages LaTeX, 2 figures; International Journal with referees article; New version (full paper design): results added in Section 2.2 and 2.2; typos removed

A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree

Abstract

Keywords

Cite

Comments

Related papers