Results 1 to 10 of about 406 (260)
The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph [PDF]
E3S Web of Conferences, 2021 Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins.
Paryati, Salahddine Krit
doaj +4 more sources
Functional Correctness of C implementations of Dijkstra's, Kruskal's, and Prim's Algorithms [PDF]
, 2021 AbstractWe develop machine-checked verifications of the full functional correctness of C implementations of the eponymous graph algorithms of Dijkstra, Kruskal, and Prim. We extend Wang et al.’s CertiGraph platform to reason about labels on edges, undirected graphs, and common spatial representations of edge-labeled graphs such as adjacency matrices ...
Anshuman Mohan +2 more
openalex +2 more sources
Morphological Traits Evaluated with Random Forest Method Explains Natural Classification of Grapevine (Vitis vinifera L.) Cultivars [PDF]
Plants, 2022 There are hundreds of morphologic and morphometric traits available to classify and identify grapevine (Vitis vinifera L.) genotypes, while statistical evaluation of those has certain limitations, especially when we have no information about the traits ...
Zsófia Szűgyi-Reiczigel +4 more
doaj +2 more sources
An Efficient Implementation of Kruskal's Algorithm for A Minimum Spanning Tree [PDF]
Journal of the Korea Society of Computer and Information, 2014 In this paper, we present an efficient implementation of Kruskal's algorithm to obtain a minimum spanning tree. The proposed method utilizes the union-find data structure, reducing the depth of the tree of the node set by making the nodes in the path to root be the child node of the root of combined tree. This method can reduce the depth of the tree by
Lee Ju-Young
openalex +3 more sources
DESIGN AND IMPLEMENTATION OF KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM IN C++
MINAR International Journal of Applied Sciences and Technology, 2020 The traditional algorithms (Prim) or (Kruskal) are able to obtain A minimum spanning tree (MST) in undirected graph easily. But many algorithms have been proposed for the purpose of obtaining spanning trees in undirected graph, these algorithms are considering the complexities of time and space.
Nadia Moqbel Hassan Al-Zubaydi
openalex +2 more sources
Watershed Delineation Algorithm Using Kruskal's Algorithm and Triangulated Irregular Network
Journal of The Korean Society of Agricultural Engineers, 2006 Watershed is the land area that contributes runoff to an outlet point. To delineate an watershed, watershed delineation using GIS that contains grid data structure is the most general method. Some researchers have studied to implement algorithms that revise the TIN topography since it is difficult to delineate watershed boundary more accurately.
Mee-Jeong Park +4 more
openalex +3 more sources
An alternative for the implementation of Kruskal's minimal spanning tree algorithm
Science of Computer Programming, 1983 AbstractAn application of the bucket sort in Kruskal's minimal spanning tree algorithm is proposed. The modified algorithm is very fast if the edge costs are from a distribution which is close to uniform. This is due to the fact that the sorting phase then takes for an m edge graph an O(m) average time.
Jyrki Katajainen, Olli Nevalainen
openalex +2 more sources
SN Applied Sciences, 2021 The development and planning of optimal network reconfiguration strategies for electrical networks is greatly improved with proper application of graph theory techniques.
Yanrenthung Odyuo +2 more
doaj +1 more source
Edge erasures and chordal graphs
Electronic Journal of Graph Theory and Applications, 2021 We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.
Jared Culbertson +2 more
doaj +1 more source
A New Approach for Solving Multi Products Transportation Problem
Journal of Kufa for Mathematics and Computer, 2021 — The problem of transportation is studied in many areas, most importantly in the field of logistics and operations management. The distribution problem of goods and commodities from sources to destinations is an important problem where many methods ...
Anwar Nsaif Jasim, Kadhim Aljanabi
doaj +1 more source