Sorry, I don't understand your search. ×
Back to Search Start Over

Parallel Algorithms for Minimum Spanning Tree Problem

Authors :
H. Ahrabian
Abbas Nowzari-Dalini
Source :
International Journal of Computer Mathematics. 79:441-448
Publication Year :
2002
Publisher :
Informa UK Limited, 2002.

Abstract

Two parallel algorithms are presented for solving the minimum cost spanning tree problem in any undirected graph. These algorithms are parallel formulations of DHEA algorithm using Depth-First Search of the graph. The cost-optimality of both algorithms are investigated.

Subjects

Subjects :
Spanning tree
Applied Mathematics
Minimum spanning tree
Connected dominating set
Computer Science Applications
Distributed minimum spanning tree
Computational Theory and Mathematics
Kruskal's algorithm
Euclidean minimum spanning tree
Reverse-delete algorithm
Gomory–Hu tree
Algorithm
MathematicsofComputing_DISCRETEMATHEMATICS
Mathematics

Details

ISSN :
10290265 and 00207160
Volume :
79
Database :
OpenAIRE
Journal :
International Journal of Computer Mathematics
Accession number :
edsair.doi...........f20fa5f7fe5d47a81ca6809b4b98d7e6

Tools

Authors Abstract Subjects Details