Results 11 to 20 of about 954,754 (291)
On encodings of spanning trees [PDF]
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hurlbert, Glenn H., Glenn H. Hurlbert
openaire +3 more sources
Spanning Trails and Spanning Trees [PDF]
, 2019 There are two major parts in my dissertation. One is based on spanning trail, the other one is comparing spanning tree packing and covering.;The results of the spanning trail in my dissertation are motivated by Thomassen\u27s Conjecture that every 4 ...
Zhang, Meng
openaire +3 more sources
Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison [PDF]
, 2006 This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible.
Moreno, J A +3 more
core +6 more sources
Successive minimum spanning trees [PDF]
Random Structures & Algorithms, 2021 AbstractIn a complete graphwith independent uniform(or exponential) edge weights, letbe the minimum‐weight spanning tree (MST), andthe MST after deleting the edges of all previous trees. We show that each tree's weightconverges in probability to a constant, with, and we conjecture that.
Svante Janson, Gregory B. Sorkin
openaire +4 more sources
End‐faithful spanning trees in graphs without normal spanning trees [PDF]
Journal of Graph Theory, 2022 AbstractSchmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to characterise other important classes of graphs. In this paper, we address Halin's question: we characterise an
Carl Bürger, Jan Kurkofka
openaire +4 more sources
The Number of Spanning Trees in Generalized Complete Multipartite Graphs of Fan-Type [PDF]
, 2011 Approaching topics such as connected simple graph, k-partite graph, complete graph, tree, Smarandache (E1,E2)-number of ...
Junliang Cai +3 more
core +1 more source
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 Polynomials of Spanning Trees [PDF]
Annals of Combinatorics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chung, Fan, Yang, Chao
openaire +1 more source
On the probabilistic min spanning tree Problem [PDF]
, 2010 International audienceWe study a probabilistic optimization model for min spanning tree, where any vertex v i of the input-graph G(V, E) has some presence probability p i in the final instance G′ ⊂ G that will effectively be optimized.
Paschos, V.T. +10 more
core +1 more source