Completely Independent Spanning Trees in (Partial) k-Trees [PDF]
Discussiones Mathematicae Graph Theory, 2015 Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint.
Matsushita Masayoshi +2 more
doaj +6 more sources
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
Discrete Applied Mathematics, 2018 The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by defining (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges ...
Olivier Togni, Benoit Darties
exaly +7 more sources
Two counterexamples on completely independent spanning trees [PDF]
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Péterfalvi, Ferenc
exaly +5 more sources
Constructing Independent Spanning Trees on Pancake Networks [PDF]
IEEE Access, 2020 For any graph G, the set of independent spanning trees (ISTs) is defined as the set of spanning trees in G. All ISTs have the same root, paths from the root to another vertex between distinct trees are vertex-disjoint and edge-disjoint.
Dun-Wei Cheng +2 more
doaj +3 more sources
Constructing Independent Spanning Trees on Transposition Networks [PDF]
IEEE Access, 2020 In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks.
Chien-Fu Lin +2 more
doaj +2 more sources
Days of Future Passed: Best Calibration Does Not Guarantee Reliable Forecasts of Future Tick Distributions [PDF]
PathogensForecasting species distributions under future climate scenarios has become a standard application of Species Distribution Models (SDMs), yet their temporal transferability is rarely evaluated. We assessed the reliability of future projections using four
Agustín Estrada-Peña
doaj +2 more sources
Completely Independent Spanning Trees in Line Graphs
Graphs and Combinatorics, 2023 20 pages with 5 ...
Toru Hasunuma
exaly +3 more sources
Node-independent spanning trees in Gaussian networks [PDF]
Journal of Parallel and Distributed Computing, 2017 Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in the network, all trees' paths from $r$ to $u$ are node-disjoint, excluding the end nodes $r$ and $u$.
Bader Albdaiwi +2 more
exaly +4 more sources
Unveiling cryptic phenology and environmental responses in subtropical evergreen broad-leaved tree canopies using phenology camera observations [PDF]
Frontiers in Plant ScienceIntroductionSeasonal canopy changes in subtropical evergreen broad-leaved forests are subtle, making it challenging to quantify phenological dynamics and their climatic drivers.MethodsUsing phenology camera (PhenoCam) imagery from evergreen broad-leaved ...
Lu Yang +22 more
doaj +2 more sources
Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network [PDF]
Jisuanji kexue, 2022 Dragonfly network,proposed by Kim et al.,is a topology for high-performance computer systems.In dragonfly network,compute nodes are attached to switches,the switches are organized into groups,and the network is organized as a two-level clique.There is a ...
BIAN Qing-rong, CHENG Bao-lei, FAN Jian-xi, PAN Zhi-yong
doaj +1 more source