Results 201 to 210 of about 406 (260)
An Approach to Parallelize Kruskal's Algorithm Using Helper Threads
2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012 In this paper we present a Helper Threading scheme used to parallelize efficiently Kruskal's Minimum Spanning Forest algorithm. This algorithm is known for exhibiting inherently sequential characteristics. More specifically, the strict order by which the algorithm checks the edges of a given graph is the main reason behind the lack of explicit ...
Anastasios Katsigiannis +3 more
openalex +2 more sources
Kruskal's Algorithm for Query Tree Optimization
11th International Database Engineering and Applications Symposium (IDEAS 2007), 2007 Pryscila Barvik Guttoski +2 more
+4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2022
Kruskal algorithm is one of the most efficient algorithms to compute a minimum spanning tree (MST) of a given weighted unoriented and connected graph. The edge list is sorted and edges are iteratively selected from it until a MST is found. To improve its performance, edge sorting can be interleaved with edge selection, so that only the relevant part of
Righini, Ermanno, Righini, Giovanni
openaire +2 more sources
Kruskal algorithm is one of the most efficient algorithms to compute a minimum spanning tree (MST) of a given weighted unoriented and connected graph. The edge list is sorted and edges are iteratively selected from it until a MST is found. To improve its performance, edge sorting can be interleaved with edge selection, so that only the relevant part of
Righini, Ermanno, Righini, Giovanni
openaire +2 more sources
Kruskal Algorithm for Construction Network Diagram
2021Extensive application of Kruskal algorithm in optimization, image processing, this paper puts forward a method to solve the key path of double code network diagram by using Kruskal algorithm, summarizes the advantages of this method, and verifies its practicability through an example, and points out that when the network diagram involves more nodes and
Lei Wang, Bo Wu, Jupu Yuan
openaire +1 more source
The analysis and application of Prim algorithm, Kruskal algorithm, Boruvka algorithm
Applied and Computational Engineering, 2023Minimum spanning tree has many applications in real life. For example, the government needs to build roads between many cities. Therefore, it is necessary to find the plan with the shortest path to save the cost. The problem is essentially generating a minimal spanning tree, and it require a suitable algorithm to find the minimum spanning tree. In this
openaire +1 more source
Online Query Optimization Through an Effective Kruskal's Algorithm
2024 4th International Conference on Innovative Sustainable Computational Technologies (CISCT)Gaurav Sharma +4 more
openalex +2 more sources
Learning Kruskal’s Algorithm, Prim’s Algorithm and Dijkstra’s Algorithm by Board Game
2008This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra's, Prim's, and Kruskal's minimum spanning tree. Then it would describe the information about the board game we choose and how to combine the game with before-mentioned three graph theories.
Wen-Chih Chang, Yan-Da Chiu, Mao-Fan Li
openaire +1 more source
The Application of Union-Find Sets in Kruskal Algorithm
2009 International Conference on Artificial Intelligence and Computational Intelligence, 2009It is the key of Krusal Algorithm to select edges and judge loop. Though realized path-compression in operation of searching tree of Union-Find Sets Data Structure, and optimized merging-operation which the shallower tree has been merged into the deeper tree, the operation of selecting edges and judging loop in Krusal Algorithm is optimized and the ...
Da-Zhi Pan +3 more
openaire +1 more source