Results 261 to 270 of about 119,472 (328)

An Optimisation Approach for Construction of a Distributed Minimum Spanning Tree (DMST) Using MPI

open access: closed, 2015
The present paper determines Distributed Minimum Spanning Tree (DMST) of very large graphs. It is very time consuming to calculate in a single machine. So the researcher has used parallel programming.
Md. Akkas Ali
openalex   +2 more sources

A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction

open access: closedSIAM journal on computing (Print), 2000
This paper presents a lower bound of $\Omega(D+\sqrt n/\log n)$ on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter $D=\Omega(\log n)$, in the bounded message model. This
David Peleg, Vitaly Rubinovich
openalex   +2 more sources

A new node-join-tree distributed algorithm for minimum weight spanning trees

open access: closed[1988] Proceedings. The 8th International Conference on Distributed, 2003
A distributed algorithm that uses a node-join-tree approach for the minimum-spanning-tree problem in a communication network is developed. The algorithm needs at most (2e+n(n-1)/4) messages in O(n/sup 2/) time on a general random graph. In the best case, it needs only 2e messages in O(log n) time.
Yao‐Nan Lien
openalex   +3 more sources

Parallelization of Minimum Spanning Tree Algorithms Using Distributed Memory Architectures [PDF]

open access: possible, 2014
Finding a minimum spanning tree of a graph is a well known problem in graph theory with many practical applications. We study serial variants of Prim’s and Kruskal’s algorithm and present their parallelization targeting message passing parallel machine with distributed memory.
Vladimir Lončar   +2 more
openaire   +2 more sources

Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs

2022 IEEE International Conference on Data Mining Workshops (ICDMW), 2022
In recent years, the Massively Parallel Computation (MPC) model capturing the MapReduce framework has become the de facto standard model for large-scale data analysis, given the ubiquity of efficient and affordable cloud implementations.
M. Bateni   +2 more
semanticscholar   +1 more source

Distributed verification of minimum spanning trees

Distributed Computing, 2006
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check whether this tree is an MST. This paper investigates the problem in the distributed setting, where the input is given in a distributed manner, i.e., every node “knows” which ...
Amos Korman, Shay Kutten
openaire   +2 more sources

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

International Conference on Quantum Computing and Engineering, 2023
We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of ...
Phillip A. Kerger   +3 more
semanticscholar   +1 more source

Distributed and Autonomic Minimum Spanning Trees

2014 Brazilian Symposium on Computer Networks and Distributed Systems, 2014
This paper presents an autonomic algorithm for constructing minimum spanning trees in a distributed system. Processes are virtually organized on a hypercube-like topology, called VCube. The spanning trees are dynamically created from any source process and regenerated transparently when processes become faulty.
Luiz A. Rodrigues   +2 more
openaire   +2 more sources

Efficient Routing in SDN using Minimum Bottleneck Spanning Tree

International Conferences on Knowledge Innovation and Invention, 2023
Software-defined networking (SDN) decouples control and data planes of network devices to manage network services and determine forwarding paths in a centralized manner. In order to reduce the occurrence of path rerouting, we proposed a routing scheme to
Yuan-Rung Yang   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy