Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Distributed_minimum_spanning_tree> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- Distributed_minimum_spanning_tree abstract "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 finallywhere D is the network, or graph diameter. A lower bound on the time complexity of the solution has been eventually shown to be".
- Distributed_minimum_spanning_tree thumbnail Minimum_spanning_tree.svg?width=300.
- Distributed_minimum_spanning_tree wikiPageID "6183392".
- Distributed_minimum_spanning_tree wikiPageRevisionID "572719314".
- Distributed_minimum_spanning_tree hasPhotoCollection Distributed_minimum_spanning_tree.
- Distributed_minimum_spanning_tree subject Category:Distributed_algorithms.
- Distributed_minimum_spanning_tree subject Category:Spanning_tree.
- Distributed_minimum_spanning_tree type Abstraction100002137.
- Distributed_minimum_spanning_tree type Act100030358.
- Distributed_minimum_spanning_tree type Activity100407535.
- Distributed_minimum_spanning_tree type Algorithm105847438.
- Distributed_minimum_spanning_tree type DistributedAlgorithms.
- Distributed_minimum_spanning_tree type Event100029378.
- Distributed_minimum_spanning_tree type Procedure101023820.
- Distributed_minimum_spanning_tree type PsychologicalFeature100023100.
- Distributed_minimum_spanning_tree type Rule105846932.
- Distributed_minimum_spanning_tree type YagoPermanentlyLocatedEntity.
- Distributed_minimum_spanning_tree comment "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.".
- Distributed_minimum_spanning_tree label "Distributed minimum spanning tree".
- Distributed_minimum_spanning_tree sameAs m.0fvln9.
- Distributed_minimum_spanning_tree sameAs Q5283163.
- Distributed_minimum_spanning_tree sameAs Q5283163.
- Distributed_minimum_spanning_tree sameAs Distributed_minimum_spanning_tree.
- Distributed_minimum_spanning_tree wasDerivedFrom Distributed_minimum_spanning_tree?oldid=572719314.
- Distributed_minimum_spanning_tree depiction Minimum_spanning_tree.svg.
- Distributed_minimum_spanning_tree isPrimaryTopicOf Distributed_minimum_spanning_tree.
