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
TL;DR: A linear-time algorithm for determining the number of b-matching in a tree is presented and it is shown that finding a b- matching is equivalent to finding a spanning subgraph in which the degree of each vertex v is at most b(v).
1 citations
Journal Article•
TL;DR: For the degree constrained minimum spanning tree problem, the basic ant algorithm is improved and the concept of degree information is presented to improve transition probability, which makes solutions feasible.
Abstract: For the degree constrained minimum spanning tree problem, the basic ant algorithm is improved The concept of degree information is presented to improve transition probability, which makes solutions feasible Degree - based tabu list in the algorithm based on depth first search is introduced to obtain connected trees Mutation as local search is to improve minimum trees It can improve its efficiency and avoid stagnation Compared with the other algorithms, numerical examples are tested which give promising results
1 citations
TL;DR: This paper is introduced to find minimum spanning tree on a connected graph where the edges have rough weights, and shows how the input data corresponding to the weights are often imprecise due to incomplete or non-obtainable information.
Abstract: In many real world problems related to weighted graphs, the input data corresponding to the weights are often imprecise due to incomplete or non-obtainable information. Finding the minimum spanning tree of such type of connected graphs is a challenge. This paper is introduced to find minimum spanning tree on a connected graph where the edges have rough weights.
1 citations
Journal Article•
TL;DR: Through analyzing the competitive decision algorithm, mixed greedy algorithm and fast reduction algorithm, and based on the concepts of the vertex degree and the idea of the greedy algorithm, the access flag is added to the vertex.
Abstract: Through analyzing the competitive decision algorithm,mixed greedy algorithm and fast reduction algorithm,and based on the concepts of the vertex degree and the idea of the greedy algorithm,the access flag is added to the vertex.Based on these ideas and the concept of decrease and conquer,it is proposed that a relatively neutral greedy algorithm of the minimum vertex cover problem.This algorithm eliminates the concept of adjacency degree,directly using the vertex degree to realize the algorithm,which reduces the time complexity of the algorithm,and easy to programming.In the worst case,the time complexity of the algorithm is O(|V|2).
1 citations
18 Aug 2002
TL;DR: This paper considers the problem of multicasting a message in k-ary n-cubes under the store-and-forward model and proposes an algorithm that grows a multicast tree in a greedy manner, in the sense that for each intermediate vertex of the tree, the outgoing edges of the vertex are selected in a non-increasing order of the number of destinations that can use the edge in a shortest path to the destination.
Abstract: In this paper, we consider the problem of multicasting a message in k-ary n-cubes under the store-and-forward model. The objective of the problem is to minimize the size of the resultant multicast tree by keeping the distance to each destination over the tree the same as the distance in the original graph. In the following, we first propose an algorithm that grows a multicast tree in a greedy manner, in the sense that for each intermediate vertex of the tree, the outgoing edges of the vertex are selected in a non-increasing order of the number of destinations that can use the edge in a shortest path to the destination. We then evaluate the goodness of the algorithm in terms of the worst case ratio of the size of the generated tree to the size of an optimal tree. It is proved that for any k/spl ges/5 and n/spl ges/6, the performance ratio of the greedy algorithm is c/spl times/kn-o(n) for some constant 1/1.2/spl les/c/spl les/1/2.
1 citations