A New Parallel Algorithm For Computing Minimum Spanning Tree
Published in Zenodo (CERN European Organization for Nuclear Research) • May 31, 2013
NobleIDNI2P555W741R539S622
Authors:,
M. I. Moussa
E. M. Badr
Abstract
Computing the minimum spanning tree of the graph is one of the fundamental computational problems. In this paper, we present a new parallel algorithm for computing the minimum spanning tree of an undirected weighted graph with vertices and edges. This algorithm uses the cluster techniques to reduce ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!