Distributed Minimum Spanning Tree
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. It is radically different from the classical sequential problem, although the most basic approach resembles Borůvka's algorithm. One important application of this problem is to find a tree that can be used for broadcasting. In particular, if the cost for a message to pass through an edge in a graph is significant, a MST can minimize the total cost for a source process to communicate with all the other processes in the network.
The problem was first suggested and solved in time in 1983 by Gallager et al., where is the number of vertices in the graph. Later, the solution was improved to and finally where D is the network, or graph diameter. A lower bound on the time complexity of the solution has been eventually shown to be
Read more about Distributed Minimum Spanning Tree: Overview, MST in Message-passing Model, GHS Algorithm, Approximation Algorithms
Famous quotes containing the words distributed, minimum and/or tree:
“Indiana was really, I suppose, a Democratic State. It has always been put down in the book as a state that might be carried by a close and careful and perfect organization and a great deal of—[from audience: “soap”Ma reference to purchased votes, the word being followed by laughter].
I see reporters here, and therefore I will simply say that everybody showed a great deal of interest in the occasion, and distributed tracts and political documents all through the country.”
—Chester A. Arthur (1829–1886)
“After decades of unappreciated drudgery, American women just don’t do housework any more—that is, beyond the minimum that is required in order to clear a path from the bedroom to the front door so they can get off to work in the mourning.”
—Barbara Ehrenreich (20th century)
“The pine tree seems to listen, the fir tree seems to wait, and neither with impatience:Mthey give no thought to the little people below them whose impatience and curiosity eat them up alive.”
—Friedrich Nietzsche (1844–1900)