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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

The minimum spanning tree is a fundamental problem in distributed networks. We wish to extend this problem into cognitive radio…

2016

2016

Distributed system has an inherent problem of unevenly distributed load. The possible solution to this problem is load balancing…

2015

The present paper determines Distributed Minimum Spanning Tree (DMST) of very large graphs. It is very time consuming to…

2014

We introduce a recursive (“anytime”) distributed algorithm that iteratively restructures any initial spanning tree of a weighted…

2009

In this article, we investigate two different distributed algorithms for constructing a minimum power broadcast tree with a…

2008

Traditionally, the performance of distributed algorithms has been measured in terms of running time and message complexity…

2007

We present a simple and efficient distributed method for determining the transmission power assignment that maximises the…

1996

In a network of asynchronous processors, the cost to send a message can differ significantly from one communication link to…

1977