A distributed algorithm for constructing a minimum diameter spanning tree
From MaRDI portal
Publication:1881298
DOI10.1016/j.jpdc.2004.03.009zbMath1106.68431arXiv1312.1961MaRDI QIDQ1881298
Christian Lavault, Franck Butelle, Marc Bui
Publication date: 4 October 2004
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1961
shortest paths; spanning trees; absolute centres; minimum diameter spanning trees; all-pairs shortest paths; shortest paths trees
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W15: Distributed algorithms
Related Items