Kruskal's Algorithm is a greedy algorithm used for finding the Minimum Spanning Tree (MST) of a connected, undirected graph. It works by sorting all edges of the graph in non-decreasing order of their ...
Heap-Sort is a comparison-based sorting algorithm that uses the properties of a binary heap (max-heap or min-heap). It efficiently sorts data in O(nlogn) time and is an in-place sorting algorithm, ...
Abstract: This paper describes an implementation of Kruskal's algorithm in query optimization process for generation of a near optimal execution query tree. The open source Post- greSQL DBMS was used ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback