Results 31 to 40 of about 3,899,169 (179)
Allometric models for improving aboveground biomass estimates in West African savanna ecosystems
Trees, Forests and People, 2021 West African Sudanian savanna ecosystems greatly contribute to local peoples’ livelihoods and climate change mitigation. Yet, the contribution of these ecosystems to carbon storage remains poorly documented due to the lack of accurate biomass predictive ...
Moussa Ganamé +4 more
doaj +1 more source
Almost disjoint spanning trees
, 2016 International audienceIn this extended abstract, we only consider connected graphs. Let k ≥ 2 be an integer and T 1 ,. .. , T k be spanning trees in a graph G. A vertex is said to be an inner vertex in a tree T if it has degree at least 2 in T. We denote
Gastineau, Nicolas +2 more
core +3 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 Independent [1, 2]-Sets in Trees
Discussiones Mathematicae Graph Theory, 2018 An [1, k]-set S in a graph G is a dominating set such that every vertex not in S has at most k neighbors in it. If the additional requirement that the set must be independent is added, the existence of such sets is not guaranteed in every graph.
Aleid Sahar A. +2 more
doaj +1 more source
Finding four independent trees [PDF]
, 2015 Motivated by a multitree approach to the design of reliable communication protocols, Itai and Rodeh gave a linear time algorithm for finding two independent spanning trees in a 2-connected graph.
Lee, O, Yu, XX, Curran, S
core +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
The mass distribution of coarse particulate organic matter exported from an Alpine headwater stream [PDF]
Earth Surface Dynamics, 2013 Coarse particulate organic matter (CPOM) particles span sizes from 1 mm, with a dry mass less than 1 mg, to large logs and entire trees, which can have a dry mass of several hundred kilograms.
J. M. Turowski +5 more
doaj +1 more source
Ore’s condition for completely independent spanning trees
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Genghua Fan, Yanmei Hong, Qinghai Liu
openaire +3 more sources
Dominator Tree Certification and Independent Spanning Trees
CoRR, 2012 How does one verify that the output of a complicated program is correct? One can formally prove that the program is correct, but this may be beyond the power of existing methods. Alternatively one can check that the output produced for a particular input satisfies the desired input-output relation, by running a checker on the input-output pair.
Loukas Georgiadis, Robert Endre Tarjan
openaire +2 more sources
Bridges in the random-cluster model
Nuclear Physics B, 2016 The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees.
Eren Metin Elçi +2 more
doaj +1 more source