Results 21 to 30 of about 3,899,169 (179)
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
IEEE Access, 2020 A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(≠ r) in G, the two paths from v to r in any two trees share no common vertex expect for v and r.
Jie-Fu Huang +3 more
doaj +1 more source
Progressive Structure from Motion by Iteratively Prioritizing and Refining Match Pairs
Remote Sensing, 2021 Structure from motion (SfM) has been treated as a mature technique to carry out the task of image orientation and 3D reconstruction. However, it is an ongoing challenge to obtain correct reconstruction results from image sets consisting of problematic ...
Teng Xiao +3 more
doaj +1 more source
Independent spanning trees of chordal rings [PDF]
Information Processing Letters, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iwasaki, Yukihiro +3 more
openaire +4 more sources
Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka +5 more
doaj +1 more source
Discrete Analysis, 2023 The Shadow Knows: Empirical Distributions of Minimal Spanning Acycles and Persistence Diagrams of Random Complexes, Discrete Analysis 2023:2, 18 pp. This paper deals with the following natural and important question.
Nicolas Fraiman +2 more
doaj +1 more source
Journal of Advances in Modeling Earth Systems, 2023 Knowledge of plant hydraulic traits is critical for simulating terrestrial water storage, ecosystem water use, and tree responses to drought. The isotopic composition of tree xylem water (δXYLEM) has proven to be useful for understanding rooting ...
K. Li, S. Kuppel, J. Knighton
doaj +1 more source
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
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
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