OurBigBook About$ Donate
 Sign in Sign up

Distributed minimum spanning tree

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Distributed algorithms
 0 By others on same topic  0 Discussions Create my own version
A Distributed Minimum Spanning Tree (DMST) is a concept in distributed computing and network design, where the objective is to construct a minimum spanning tree (MST) from a graph that is partitioned across multiple processors or nodes in a distributed environment. In a minimum spanning tree (MST), the aim is to connect all vertices in a weighted graph using the least total edge weight, without any cycles.

 Ancestors (6)

  1. Distributed algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook