Skip to search formSkip to main contentSkip to account menu

Distributed minimum spanning tree

Known as: Distributed Minimim Spanning Tree 
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Borůvka's algorithmDistributed algorithmDistributed computingFIFO (computing and electronics)

Broader (1)

Spanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Twelfth International Multi-Conference on Information Processing-2016 ( IMCIP-2016 ) A Distributed Minimum Spanning Tree for Cognitive Radio Networks
The minimum spanning tree is a classical problem in distributed system environment. We extend this challenge in Cognitive Radio… 
2011
2011
GDCA: A Distributed Channel Assignment Mechanism for Multi-radio Multi-Channel Wireless Mesh Networks
C hannel assignment is one of the most important problem in the research of the multi-radio multi-channel wireless mesh networks… 
2008
2008
Energy-Efficient Distributed Minimum Spanning Tree Construction : Tight Bounds and Algorithms
Traditionally, the performance of distributed algorithms has been measured in terms of running time and message complexity… 
2008
2008
Energy efficient broadcasting in wireless ad hoc networks
In recent years wireless multi-hop networks have attracted significant attention due to their wide range of potential civil and… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)