Distributed minimum spanning tree: Difference between revisions

Revision as of 19:55, 13 September 2006

Revision as of 19:03, 21 November 2006

Line 1:

{{Cleanup-date|July 2006}}

'''Distributed minimum spanning tree''' problem has similar meaning as [[minimum spanning tree]] problem, but is different in definition of inputs/outputs and is totally different in its solution approaches, although most basic paradigm resembles [[Borůvka's algorithm]] approach.

The problem was first suggested and solved in <math>O(V \log V)</math> time in 1983 by Gallagher et al