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: A self-stabilizing algorithm for computing the median in a given tree graph is proposed and the correctness of the proposed algorithm is shown by using a new technique involving induction.

12 citations

Journal ArticleDOI
TL;DR: This paper combines quantum computing with artificial bee colony and design a spanning tree construction algorithm for industrial wireless sensor networks and shows that the new proposed algorithm can obtain more alternative solutions and has a better performance in search efficiency.
Abstract: In industrial Internet, many intelligent applications are implemented based on data collection and distribution. Data collection and data distribution in the wireless sensor networks are very important, where the node topology can be described by the spanning tree for obtaining an efficient transmission. Classical algorithms in graph theory such as the Kruskal algorithm or Prim algorithm can only find the minimum spanning tree (MST) in industrial wireless sensor networks. Swarm intelligence algorithm can obtain multiple solutions in one calculation. Multiple solutions are very helpful for improving the reliability of industrial wireless sensor networks. In this paper, we combine quantum computing with artificial bee colony and design a spanning tree construction algorithm for industrial wireless sensor networks. Quantum computations are introduced into the onlooker bees search. Food source replacement strategy is improved. Finally, the algorithm is simulated and evaluated. The results show that the new proposed algorithm can obtain more alternative solutions and has a better performance in search efficiency.

12 citations

Journal ArticleDOI
TL;DR: In this paper, the Stackelberg Minimum Spanning Tree (StackMST) problem was shown to be APX-hard when the number of distinct red edge weights is 2.

12 citations

Journal ArticleDOI
TL;DR: An O(n2) algorithm to find the characteristic polynomial of the adjacency matrix of any tree is described.

12 citations

Proceedings ArticleDOI
19 Apr 2009
TL;DR: This work uses polygonal approximation to reduce the complexity of the boundaries and extract features from them and these features are used to feed the LCS dynamic programming algorithm, which is then used into a modified Prim's algorithm to find the best match among all pieces.
Abstract: In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim's algorithm. Firstly, we use polygonal approximation to reduce the complexity of the boundaries and extract features from them. Thereafter, these features are used to feed the LCS dynamic programming algorithm. The scores yielded by the LCS algorithm are then used into a modified Prim's algorithm to find the best match among all pieces. Comprehensive experiments on a database composed of 100 shredded documents support the efficiency of the proposed methodology. When compared to global search algorithms, this approach brings an improvement of 18% in the number of fragments reconstructed.

12 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