A distributed algorithm for constructing a minimum diameter spanning tree

Authors:
Marc Bui;Franck Butelle;Christian Lavault
Affiliations:
Laboratoire de Recherche LDCI, Université Paris 8, France;Laboratoire de Recherche LIPN, CNRS UMR, A-7030, Université Paris, Nord, 99 Av. J.-B. Clement, Villetaneuse 93430, 13 France;Laboratoire de Recherche LIPN, CNRS UMR, A-7030, Université Paris, Nord, 99 Av. J.-B. Clement, Villetaneuse 93430, 13 France
Venue:
Journal of Parallel and Distributed Computing
Year:
2004

Citing 11
Cited 9

Complexity of network synchronization

Journal of the ACM (JACM)
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A message-optimal algorithm for distributed termination detection

Journal of Parallel and Distributed Computing
Data networks (2nd ed.)

Data networks (2nd ed.)
Minimum diameter spanning trees and related problems

SIAM Journal on Computing
Maintenance of a minimum spanning forest in a dynamic plane graph

Journal of Algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Algorithms

Distributed Algorithms
Maintaining Spanning Trees of Small Diameter

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
On Shortest Networks for Classes of Points in the Plane

CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)

A synchronization protocol for supporting peer-to-peer multiplayer online games in overlay networks

Proceedings of the second international conference on Distributed event-based systems
Optimal maintenance of a spanning tree

Journal of the ACM (JACM)
Adaptive price update in distributed Lagrangian relaxation protocol

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Implementing a model of Japanese tree frogs' calling behavior in sensor networks: a study of possible improvements

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
A distributed algorithm for a b-coloring of a graph

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
A simulation analysis of multiagent-based dynamic request placement techniques

IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Motion-aided network SLAM with range

International Journal of Robotics Research
A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree

DISC'07 Proceedings of the 21st international conference on Distributed Computing
An incremental distributed algorithm for a partial Grundy coloring of graphs

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

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, ω). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute centre 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.