Results 21 to 30 of about 140,549 (266)
, 2016 Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying concept behind all these orders has been shown: they can be described by a graph ...
Schlipf, Lena, Schmidt, Jens M.
core +2 more sources
Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks
Journal of Mathematics, 2022 Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks.
Haiqin Liu, Yanling Shao
doaj +1 more source
The concept of exchangeability in ensemble forecasting [PDF]
Nonlinear Processes in Geophysics, 2011 A set of random variables is exchangeable if its joint distribution function is invariant under permutation of the arguments. The concept of exchangeability is discussed, with a view towards potential application in evaluating ensemble forecasts.
J. Bröcker, H. Kantz
doaj +1 more source
Parallel Construction of Edge-independent Spanning Trees in Augmented Cubes [PDF]
Jisuanji kexueIn recent years,more and more research work is being conducted around interconnected networks.Independent spanning trees(ISTs) can be used in reliable transmission,parallel transmission,safe distribution of information,and parallel diagnosis of fault ...
LI Xiajing, CHENG Baolei, FAN Jianxi, WANG Yan, LI Xiaorui
doaj +1 more source
Completely Independent Spanning Trees in k-Th Power of Graphs
Discussiones Mathematicae Graph Theory, 2018 Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of
Hong Xia
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
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
Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree [PDF]
, 2014 We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing ...
A. Cournier +22 more
core +1 more source
Simplicial and Cellular Trees [PDF]
, 2015 Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension.
Duval, Art M. +2 more
core +2 more sources
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