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.

Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency

Abstract: The invention discloses a cluster tree hierarchical wireless sensor network routing method with the optimized energy efficiency. The method includes the first step of automatically and dynamically organiing clustering during a cluster construction period, the second step of carrying out random selection on cluster head nodes according to the energy balance principle through the consideration on node energy factors, the third step of utilizing a minimum spanning tree Prim algorithm to construct a cluster tree hierarchical network route, namely, points in the Prim algorithm correspond to the cluster head nodes selected in a wireless sensor network, and the weights of sides correspond to energy weighting distances between the cluster head nodes, and the fourth step of constructing the cluster head nodes to a multi-hop routing network structure. Through the protocol, the cluster heads are reasonably selected in the application of the wireless sensor network which is powered through the energy harvesting technology, and consequently effective utilization of energy can be achieved, the communication cost between the nodes is reduced, the problem of the premature death of the cluster head nodes due to long-distance communication is solved, and the prolonging of the lifetime of the whole network is facilitated; in addition, the application of the spanning tree algorithm enhances the expandability of the protocol.

New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem

Abstract: Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V|i - 1. In present paper a new randomized greedy heuristic algorithm and a new recombination method in genetic algorithm for solving BDMST are developed. Results of computational experiments are reported to show the efficiency of these algorithms.

Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs

Abstract: Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of the original graph. Minimum spanning tree heuristic (MSTH) is a heuristic for solving the Steiner problem in graphs. In this paper we first review existing algorithms for solving the Steiner problem in graphs. We then introduce a new parallel version of MSTH on three dimensional mesh of trees architecture. We describe our algorithm and analyze its time complexity. The time complexity analysis shows that the algorithm's running time is O(lg2 n) which is comparable with other existing parallel solutions.

Decreasing path algorithm for minimum flows: dynamic tree implementations

Abstract: We present an algorithm for finding minimum flow in networks with arcs capacities using the dynamic tree implementation As a final part, we present an example for this algorithm