Results 11 to 20 of about 406 (260)
Note on the Structure of Kruskal’s Algorithm [PDF]
Algorithmica, 2008 Let \(G=(V,E)\) be a connected edge-weighted graph and let \((V,F)\) be its minimal spanning tree constructed by Kruskal's algorithm [\textit{J.B. Kruskal jun.}, ``On the shortest spanning subtree of a graph and the traveling salesman problem,'' Proc.\ Am.\ Math.\ Soc.\ 7, 48--50 (1956; Zbl 0070.18404)].
Broutin, Nicolas +2 more
openaire +2 more sources
Non-perfect maze generation using Kruskal algorithm
Jurnal Natural, 2021 A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze. This paper discusses non-perfect maze generation with two kind of biases, that is, horizontal and vertical wall bias and cycle bias.
MAHYUS IHSAN +4 more
openaire +3 more sources
The Diameter of the Minimum Spanning Tree of a Complete Graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Let $X_1,\ldots,X_{n\choose 2}$ be independent identically distributed weights for the edges of $K_n$. If $X_i \neq X_j$ for$ i \neq j$, then there exists a unique minimum weight spanning tree $T$ of $K_n$ with these edge weights.
Louigi Addario-Berry +2 more
doaj +1 more source
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2021 Abstrak Ujian Nasional yang dilaksanakan setiap tahun di Indonesia telah menghasilkan banyak data, termasuk di Provinsi Lampung. Pada rentang tahun 2015 sampai dengan tahun 2018, telah terkumpul kurang lebih 11 juta data hasil ujian nasional.
Sugama Maskar, Nicky Dwi Puspaningtyas
doaj +1 more source
Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
IJID (International Journal on Informatics for Development), 2014 Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight.
Paryati Paryati, Ahmad Subhan Yazid
doaj +1 more source
A Note on Ultrametric Spaces, Minimum Spanning Trees and the Topological Distance Algorithm
Information, 2020 We relate the definition of an ultrametric space to the topological distance algorithm—an algorithm defined in the context of peer-to-peer network applications.
Jörg Schäfer
doaj +1 more source
CSID Journal of Infrastructure Development, 2020 The logistics and distribution system in the retail industry in Indonesia has its own complexity. The growth and productivity of the retail outlets in Indonesia have been increasing from year to year.
Zulkarnain Zulkarnain +3 more
doaj +1 more source
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2012 One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005).
Swaditya Rizki
doaj +1 more source
Geo-MST: A geographical minimum spanning tree plugin for QGIS
SoftwareX, 2020 Graphs describing the relation between nodes and edges are common in geographic information science. One of the algorithms that operate on graphs is ‘Minimum Spanning Tree (MST)’, which is a tree that connects all the nodes of a graph with minimum cost ...
Murat Çalışkan, Berk Anbaroğlu
doaj +1 more source
Discrete Analysis, 2023 The Shadow Knows: Empirical Distributions of Minimal Spanning Acycles and Persistence Diagrams of Random Complexes, Discrete Analysis 2023:2, 18 pp. This paper deals with the following natural and important question.
Nicolas Fraiman +2 more
doaj +1 more source