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 published on a yearly basis
Papers
More filters
01 Jan 2009
TL;DR: This paper proposes a method based on a two-step procedure to solve the undirected Steiner tree problem in graphs efficiently, and shows that the algorithm efficiently presents very correct solutions to the benchmark problems.
Abstract: The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.
1 citations
TL;DR: This paper describes the formation structure of a dynamic virtual GRID system that is built on the basis of the minimum spanning tree algorithm and proposes a new algorithm for constructing spanning tree for the DV GRID that adapts to the dynamics of the changeable environment and forms the tree based on the vertex with maximum degree.
Abstract: This paper describes the formation structure of a dynamic virtual GRID system that is built on the basis of the minimum spanning tree algorithm which increase the efficiency of GRID-system by presenting it in a dynamic virtual GRID system. Moreover, we develop a distributed routing algorithm that produces routing tables based on the routing agents located at the nodes of virtual GRID-systems. In addition to a comparative analysis of the proposed formation of the GRID system, we propose a new algorithm for constructing spanning tree for the DV GRID that adapts to the dynamics of the changeable environment and forms the tree based on the vertex with maximum degree. Our results clearly show the superiorities of the proposed algorithm over available algorithms in terms of performance and resource allocation. To create routing tables and virtual GRID-systems forming, we have used GridSim simulator.
1 citations
TL;DR: This paper focuses on the influence on the process of path planning caused by scenic spots' own structural features such as multiple entrances or exits, and proposes a doubleweighted Graph Model, for the weight of both vertexes and edges of proposed Model can be selected dynamically.
Abstract: When tourists visiting multiple tourist scenic spots, the travel line is usually the most effective road network according to the actual tour process, and maybe the travel line is different from planned travel line. For in the field of navigation, a proposed travel line is normally generated automatically by path planning algorithm, considering the scenic spots' positions and road networks. But when a scenic spot have a certain area and have multiple entrances or exits, the traditional described mechanism of single point coordinates is difficult to reflect these own structural features. In order to solve this problem, this paper focuses on the influence on the process of path planning caused by scenic spots' own structural features such as multiple entrances or exits, and then proposes a doubleweighted Graph Model, for the weight of both vertexes and edges of proposed Model can be selected dynamically. And then discusses the model building method, and the optimal path planning algorithm based on Dijkstra algorithm and Prim algorithm. Experimental results show that the optimal planned travel line derived from the proposed model and algorithm is more reasonable, and the travelling order and distance would be further optimized.
1 citations
01 Jan 2021
TL;DR: An attempt has been made to present an improved handoff (Imp-Handoff) algorithm as an efficient fault-tolerant technique over the traditional handoff algorithm.
Abstract: The fault tolerance in wireless sensor networks (WSN) has become the foremost task as the sensor networks are involved in every aspect of human life. The Fault Tolerance supports energy efficiency, and energy efficiency is directly related to network lifetime, which is a prominent parameter in sensor networks. In this paper, an attempt has been made to present an improved handoff (Imp-Handoff) algorithm as an efficient fault-tolerant technique over the traditional handoff algorithm. At the first stage of the proposed work, a minimum spanning tree (MST) had been generated using the traditional PRIMS algorithm and various Swarm Intelligence approaches, viz. the Ant Colony Algorithm (ACO), Particle Swarm Algorithm (PSO), Firefly Algorithm (FF), and Imperialistic Competitive Algorithm (ICA). Then, data transmission had been performed on these spanning trees using the handoff and the proposed Imp-handoff algorithm. A comparative analysis of the said algorithms is presented in the result analysis section on some critical parameters, i.e., throughput, end-to-end delay, and energy dissipation.
1 citations