Abstract
In the life, we always aim to do anything with the less cost considering time and distance. In graph theory, finding a minimum weight (cost or path) is a well-known problem. A minimum spanning tree is one of the methods brought for this purpose. In this work, we consider a negligence algorithm to find a minimum spanning tree in another way. We report a comparison between our algorithm and Kruskal's MST algorithm. We implemented some examples of the graphs to get the results in less time and more effectively.
Keywords
Kruskal's algorithm
Minimum spanning tree
Distributed minimum spanning tree
Reverse-delete algorithm
Spanning tree
Prim's algorithm
Minimum weight
Euclidean minimum spanning tree
Path (computing)
Computer science
Shortest-path tree
Algorithm
Graph
Mathematics
Mathematical optimization
Combinatorics
Subject Areas
Big Data and Business Intelligence
·Management Information Systems ·Social Sciences
Data Management and Algorithms
·Signal Processing ·Physical Sciences
Advanced Database Systems and Queries
·Computer Networks and Communications ·Physical Sciences
Citations by Year
2022: 1
Loading…
Loading…