Results 21 to 30 of about 41,748 (161)
On the Length of a Random Minimum Spanning Tree [PDF]
Combinatorics, Probability and Computing, 2015 We study the expected value of the lengthLnof the minimum spanning tree of the complete graphKnwhen each edgeeis given an independent uniform [0, 1] edge weight. We sharpen the result of Frieze [6] that limn→∞$\mathbb{E}$(Ln) = ζ(3) and show that$$ \mathbb{E}(L_n)=\zeta(3)+\frac{c_1}{n}+\frac{c_2+o(1)}{n^{4/3}}, $$wherec1,c2are explicitly defined ...
Colin Cooper +4 more
openaire +3 more sources
Edge-Preserving Stereo Matching Using Minimum Spanning Tree
IEEE Access, 2019 Despite that the accuracy and efficiency of stereo matching technology have significantly improved in the past decades, the issue of edge-blurring remains a challenge to most of the existing approaches.
Congxuan Zhang +5 more
doaj +1 more source
The Spanning Tree of a Divisible Multiple Graph
Моделирование и анализ информационных систем, 2018 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges.
Alexander V. Smirnov
doaj +1 more source
Minimum Spanning Trees on Random Networks [PDF]
Physical Review Letters, 2001 Physical Review ...
Dobrin, R., Duxbury, P. M.
openaire +3 more sources
Spanning trees with small diameters
AKCE International Journal of Graphs and Combinatorics, 2020 A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Bounded-Angle Minimum Spanning Trees
Algorithmica, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmad Biniaz +3 more
openaire +3 more sources
Extensions of the minimum labelling spanning tree problem
Journal of Telecommunications and Information Technology, 2006 In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic
Raffaele Cerulli +2 more
doaj +1 more source
Clustering of online learning resources via minimum spanning tree [PDF]
AAOU Journal, 2016 Purpose - The quick growth of web-based and mobile e-learning applications such as massive open online courses have created a large volume of online learning resources.
Qingyuan Wu +4 more
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
Involve, a Journal of Mathematics, 2009 The minimum spanning tree problem originated in the 1920s when O. Borůvka identified and solved the problem during the electrification of Moravia. This graph theory problem and its numerous applications have inspired many others to look for alternate ways of finding a spanning tree of minimum weight in a weighted, connected graph since Borůvka’s time ...
Jayawant, Pallavi, Glavin, Kerry
+5 more sources