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
28 Oct 2020
TL;DR: This research was conducted to answer the crucial needs of a weighted graph settlement application that is useful for completing a graph with the Kruskal algorithm and Prim algorithm.
Abstract: A graph has several algorithms in its solution, including the Kruskal algorithm and Prim algorithm, both of which are greedy algorithms for determining the minimum spanning tree. Completion of graphs is useful in various fields of life, so an accurate graph calculation is important. Making an application to solve a graph, especially the Kruskal algorithm and Prim algorithm aims to facilitate the work of the graph so as to produce an accurate final result. The flow of research carried out are: a background review of research, study of literature and relevant literature, application design, building desktop-based applications, as well as implementation and application tests. The level of technological readiness or TKT in this research is based on self-assessment which is at level 7, meaning the prototype demonstration system in the actual environment, with details of the TKT indicators as follows: TKT indicator 1 is met, TKT indicator 2 is met, TKT indicator 3 is not met, TKT indicator 4, TKT indicator 5 are met, TKT indicator 6 are met, TKT indicator 7 is met, TKT indicator 8 and 9 are not met. The application that has been built is useful for completing a graph with the Kruskal algorithm and Prim algorithm. This research was conducted to answer the crucial needs of a weighted graph settlement application.
18 Jul 2020
TL;DR: Wang et al. as discussed by the authors proposed an optimal solution analysis of octagonal Steiner tree problem based on GPU acceleration, which can effectively improve the data convergence and fully meet the research requirements.
Abstract: In order to improve the effect of solving the octagonal Steiner tree problem better, the optimal solution analysis of octagonal Steiner tree problem based on GPU acceleration is proposed. Combining with prim algorithm, the relay point of octagonal Steiner tree is cut in. In order to better shorten the routing path, the GPU acceleration principle is used for global search, the routing path is scientifically standardized, the range of inflection point is reasonably defined, and the research requirements for effective analysis of the optimal solution of octagonal Steiner tree problem are finally realized. Finally, it is proved by experiments that the GPU accelerated optimal solution analysis method for octagonal Steiner tree problem is more effective in practical application, and can effectively improve the data convergence and fully meet the research requirements.
TL;DR: It is shown that the complexity of an algorithm of Wang is O(n), and the case when the edges of the tree is weighted as well is studied.
Abstract: We study the problem of finding the maximum interval subgraph in a tree. This problem is related to the Double Digestion Problem of DNA physical mapping. We show that the complexity of an algorithm of Wang is O(n). We also present a linear algorithm of our own. We study the case when the edges of the tree is weighted as well. An algorithm with complexity O(n3) is presented.
01 Jul 2017
TL;DR: A detailed analysis of this algorithm is presented, showing how its design contributes to a more streamlined operation and an improved time complexity over the original — and only other known to the authors — binary tree roll algorithm.
Abstract: This paper presents a new, linear algorithm for performing the roll operation on binary trees. Based on the inorder tree traversal, this algorithm has a very simple structure and achieves linear time and space complexity. A detailed analysis of this algorithm is presented, showing how its design contributes to a more streamlined operation and an improved time complexity over the original — and only other known to the authors — binary tree roll algorithm. A practical implementation of both algorithms is benchmarked by counting the minimum and maximum numbers of basic operations, as well as measuring the minimum and maximum amounts of memory space required by the algorithms to run to completion, across all binary tree topologies with progressively increasing numbers of nodes. Results obtained from this empirical analysis quantify the best-and worst-case complexities of both algorithms and show how the improved algorithm outperforms the original one asymptotically, particularly in regards to their time complexity.
01 Jan 2016
TL;DR: A new methodology is designed and developed to find minimum spanning tree using subtraction and remainder procedure, which also uses Greedy approach.
Abstract: Efficient routing problem exists from several years. Spanning tree plays very important role to design routing algorithms efficiently. To obtain the minimum cost a minimum spanning tree is formed from the given graph. Greedy technique plays important role to generate minimum spanning tree. Several approaches exists to solve minimum spanning tree but in this paper a new methodology is designed and developed to find minimum spanning tree using subtraction and remainder procedure. This procedure also uses Greedy approach. The main objective is to present a new way to find minimum spanning tree. An example is also given to understand the procedure in efficient way.