DocumentCode :
771212
Title :
A Distributed Algorithm for Minimum Weight Directed Spanning Trees
Author :
Humblet, Pierre A.
Author_Institution :
MIT, Cambridge, MA, USA
Volume :
31
Issue :
6
fYear :
1983
fDate :
6/1/1983 12:00:00 AM
Firstpage :
756
Lastpage :
762
Abstract :
A distributed algorithm is presented for constructing minimum weight directed spanning trees (arborescences), each with a distinct root node, in a strongly connected directed graph. A processor exists at each node. Given the weights and origins of the edges incoming to their nodes, the processors follow the algorithm and exchange messages with their neighbors until all arborescences are constructed. The amount of information exchanged and the time to completion are 
.
.Keywords :
Communication system economics; Distributed computing; Trees; Broadcasting; Communication networks; Computer errors; Costs; Database systems; Delay; Distributed algorithms; Intelligent networks; Network topology; Tree graphs;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1983.1095883
Filename :
1095883
Link To Document :
