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.

Tree Decomposition and its Applications in Algorithms:Survey

Abstract: Tree width and tree decomposition are two important concepts developed by graph minor theory.Because of its own characteristics,tree decomposition plays an important role in algorithm design.The tree width of graph,tree decomposition algorithm,applications of tree decomposition algorithm for problem solving in a complex problems were deeply analysed.Three aspects of the related research in recent years were given a thorough analysis and presentation,and a number of important principles and methods were presented by some simple examples.Furthermore,a few future research issues were outlined.

Method for offshore wind power collection and power transmission system joint topological optimization

Abstract: The invention discloses a method for offshore wind power collection and power transmission system joint topological optimization. Firstly, a traditional Prim algorithm is combined with a genetic algorithm to carry out crossover, mutation and selection operations after edge set coding of the initial population, and then the shortest topological structure of the submarine cable route is obtained. Then, the optimal route searching algorithm based on gridding is used to optimize the optimal path of transmission submarine cable obstacle avoidance. Finally, for each position of the offshore booster station, the power collection and power transmission systems are subjected to optimization to get the total cost as fitness, and the particle swarm optimization method is used to the optimal position of the offshore booster station. The method converges quickly and has strong optimization ability, and can quickly find the topologic structure with shorter paths.

A Combination of K-means Algorithm and Optimal Path Selection Method for Lifetime Extension in Wireless Sensor Networks

Abstract: Wireless Sensor Networks (WSN) are special types of wireless networks where hundreds or thousands of sensor nodes are working together. Since the lifetime of each sensor is equivalent to a battery, the energy issue is considered a major challenge. Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Many clustering algorithms consider the residual energy and distance between the nodes in the selection of cluster heads and others rotate the selection of cluster heads periodically. We propose in this article a CH selection followed by making clusters using the K-means algorithm and we present the PRIM algorithm to transmit the packets in multi-hop transmission between CHs and BS and choose the optimal path. The clustering scheme allows to decrease intra-cluster communications and to gain energy efficiency for sensor nodes. Computer simulation results show that our method aims to extend the lifetime of the wireless sensor network efficiently compared to other existing methods.

Minimum Spanning Trees

Abstract: The minimum spanning tree (MST) problem is one of the simplest and most studied classical optimization problems. It is concerned with finding a spanning tree of an undirected, connected graph such that the sum of the weight of selected arcs is at a minimum and, therefore, sometimes it is also referred to as the minimum weight spanning tree problem. The importance of MSTs can be derived from its wide range of both direct and indirect applications, some of which are described in this article. Several efficient solution techniques have been used effectively for many years, playing a central role in generating important ideas for designing algorithms for other combinatorial problems. We discuss two classical algorithms: Prim's algorithm and Kruskal's algorithm, followed by recent developments that improve the asymptotic time bounds using advanced data structures. Keywords: spanning tree; Prim's algorithm; Kruskal's algorithm; min–max path

A routing protocol of vehicular heterogeneous network based on the Dijkstra algorithm

Abstract: With the development of intelligent transportation, the vehicular smart system has become a focus of the academic and industrial communities. The routing protocol is one of the most significant issues in the vehicular heterogeneous network. The paper uses the Dijkstra algorithm to obtain the optimal routing path. To evaluate the performance of the Dijkstra algorithm, it is compared with the minimum tree model based on the Prim algorithm. The simulation experiments are based on the MATLAB platform. The experimental results indicate the Dijkstra algorithm achieves the best performance.