Results 41 to 50 of about 43,946 (309)
Involve, a Journal of Mathematics, 2009 Recall the problem of installing a new computer network we introduced in Chap. 1. Using the vocabulary we have learned we can restate it more formally and more abstractly as the problem to find a Minimum Connected ...
Winfried Hochstättler +1 more
+5 more sources
Estimating the weight of metric minimum spanning trees in sublinear time [PDF]
, 2008 In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler +3 more
core +1 more source
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
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications, 2021 We investigate the problem of finding a spanning tree of a set of $n$ moving points in $\mathbb{R}^{\dim}$ that minimizes the maximum total weight (under any convex distance function) or the maximum bottleneck throughout the motion. The output is a single tree, i.e., it does not change combinatorially during the movement of the points.
Hugo A. Akitaya +6 more
openaire +1 more source
Drawing a tree as a minimum spanning tree approximation
Journal of Computer and System Sciences, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DI GIACOMO, Emilio +3 more
openaire +2 more sources
Minimum Restricted Diameter Spanning Trees
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Refael Hassin, Asaf Levin
openaire +1 more source
A minimum spanning tree analysis of the Polish stock market
Journal of Economics and Management, 2022 Aim/purpose – This article aims to explore the network topology of the stock market in Poland during the COVID-19 pandemic.
Tomeczek Artur F.
doaj +1 more source
CoRR20 pages, 14 figures. Full version of a paper to be presented at the 41st European Workshop on Computational Geometry, Liblice, Czech republic, April 9-11, 2025. (EuroCG'25)
Katharina Klost +4 more
openaire +2 more sources
The Budgeted Labeled Minimum Spanning Tree Problem
MathematicsIn order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli +3 more
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