scispace - formally typeset
Search or ask a question
Topic

Prim's algorithm

About: Prim's algorithm is a research topic. Over the lifetime, 775 publications have been published within this topic receiving 17971 citations. The topic is also known as: DJP algorithm & Jarník algorithm.


Papers
More filters
Journal ArticleDOI
TL;DR: From the simulation results, it is found that the spanning tree constructed by the proposed algorithm obtains a greater improvement in terms of end-to-end transmission delay as the traffic concentration becomes more pronounced.

2 citations

Proceedings ArticleDOI
21 Mar 2011
TL;DR: This paper presents a Hybrid Genetic Algorithm (HGA) combining the basic GA with the ideas of the Particle Swarm Optimization (PSO) algorithm, and shows that this HGA outperforms the previous GAs with faster convergence and better solution.
Abstract: Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand and distance between each pair of nodes. This paper presents a Hybrid Genetic Algorithm (HGA) combining the basic GA with the ideas of the Particle Swarm Optimization (PSO) algorithm. In HGA, each individual exploits information of its own experience to search through the solution space with genetic operator. The experiment results show that our HGA outperforms the previous GAs with faster convergence and better solution.

2 citations

Proceedings ArticleDOI
21 Jun 2013
TL;DR: This paper presents an algorithm based on the divide and conquer for Delaunay triangulation together with the Prim's algorithm to produce an O(nlogn) algorithm for minimum spanning tree problem in the plane, implements the visual graphic interface with various selected algorithms for plane minimum spanning Tree and compares their running time.
Abstract: N points are given in the Euclidean plane, and the minimum spanning tree problem seeks for a minimum spanning tree interconnecting the n points so that there is only one path between any two points. One of the classic and frequently-used algorithms for minimum spanning tree problem is Prim's algorithm, but it consumes large time and space complexity for the plane minimum spanning tree problem is of O(n2) numbers of edges. Luckily, it was proved that the plane minimum spanning tree is a sub-graph of Delaunay triangulation for the given points in the plane, and the number of edges in the triangulation is O(n). This motivates us to efficiently compute the Delaunay triangulation of the given points and then find the minimum spanning tree in the triangulation. This paper presents an algorithm based on the divide and conquer for Delaunay triangulation together with the Prim's algorithm to produce an O(nlogn) algorithm for minimum spanning tree problem in the plane, implements the visual graphic interface with various selected algorithms for plane minimum spanning tree and compares their running time.

2 citations

Journal Article
TL;DR: In this article, an associative parallel algorithm for updating a minimum spanning tree when a vertex and all its incident edges are deleted from the underlying graph is presented, which is represented as the corresponding procedure implemented on a model of associative Parallel Systems of the SIMD type with vertical data processing (the STAR-machine).
Abstract: In this paper, we propose an associative parallel algorithm for updating a minimum spanning tree when a vertex and all its incident edges are deleted from the underlying graph. This algorithm is represented as the corresponding procedure implemented on a model of associative parallel systems of the SIMD type with vertical data processing (the STAR-machine). We justify the correctness of this procedure and evaluate its time complexity.

2 citations

Journal Article
Ren Lian1
TL;DR: Experimental results show that the proposed pavement crack connection algorithm significantly improves the continuity of the detected crack targets, the detection accuracy rate of which is higher than other algorithms with by 6 ~13 percentage.
Abstract: When the digital image processing technology is used to detect the cracks on the pavement,it is very hard to detect an intact structure for the cracks because parts of the cracks are very narrow,or shadowed by other objects,or filled with dust. These seriously affects the accuracy of the crack parameter measurement and damage index evaluation. Aiming at the problems above,a pavement crack connection algorithm using Prim minimum spanning tree is proposed. The ridge detection method is used to mark out all the suspicious cracks targets,with the shape features of cracks to remove the noises like spots or blocks. So all the long or obvious cracks are remained. Using the morphology method,the endpoints of the remained crack segments are extracted,and the Prim algorithm is used to construct a minimum spanning tree and makes all the discontinuous cracks connected. All the forced pseudo connections are deleted through the orientation and contrast characteristics of the cracks. On the basis of connection,the cracks are enhanced by filling operation and an intact crack structure is acquired.200 pavement images with cracks are tested,and the Hausdorff distance is used to evaluate the performance of various algorithms. Experimental results show that the proposed algorithm significantly improves the continuity of the detected crack targets,the detection accuracy rate of which is higher than other algorithms with by 6 ~13 percentage.

2 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
82% related
Tree (data structure)
44.9K papers, 749.6K citations
78% related
Metaheuristic
29.9K papers, 921K citations
78% related
Scheduling (computing)
78.6K papers, 1.3M citations
77% related
Computational complexity theory
30.8K papers, 711.2K citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
20224
202113
20208
201920
201815