Revision as of 20:21, 23 August 2006 edit 65.70.89.241 (talk) {{merge\|spanning tree protocol}} ← Previous edit		Revision as of 23:19, 23 August 2006 edit undo LimoWreck (talk \| contribs) Extended confirmed users 3,849 edits m veeeery bad idea - almost unrelated Next edit →
Line 1: {{Cleanup-date\|July 2006}} ~~{{merge\|spanning tree protocol}}~~ 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.

Distributed minimum spanning tree: Difference between revisions