Results 11 to 20 of about 4,433,930 (229)
Contributions to Discrete MathematicsLet $T_{1},T_{2},\dots,T_{k}$ 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 $T_{1},T_{2},\dots,T_{k}$ are completely independent spanning trees.
Xia Hong 0005, Feng Gao, Zengbao Wu
core +4 more sources
Completely independent spanning trees in the hypercube [PDF]
CoRR16 pages, 1 ...
Shaw, Benedict Randall
core +4 more sources
Constructing completely independent spanning trees in crossed cubes
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baolei Cheng, Dajin Wang, Jianxi Fan
openaire +3 more sources
Completely independent spanning trees for enhancing the robustness in ad-hoc Networks [PDF]
2017 IEEE 13th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2017 We investigate the problem of computing Completely Independent Spanning Trees (CIST) under a practical approach. We aim to show that despite CISTs are very challenging to exhibit in some networks, they present a real interest in ad-hoc networks and can be computed to enhance the network robustness.
Moinet, Axel +4 more
openaire +3 more sources
Dual Protection Routing Trees on Graphs
Mathematics, 2023 In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node
Kung-Jui Pai
doaj +1 more source
Completely Independent Spanning Trees on Some Interconnection Networks
IEICE Transactions on Information and Systems, 2014 Kung-Jui Pai +2 more
exaly +4 more sources
Completely Independent Spanning Trees in Line Graphs [PDF]
, 2022 Completely independent spanning trees in a graph $G$ are spanning trees of $G$ such that for any two distinct vertices of $G$, the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint.
Hasunuma, Toru
core +1 more source
Completely Independent Spanning Trees on 4-Regular Chordal Rings
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2017 Kung-Jui Pai +2 more
exaly +3 more sources
Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes
IEICE Transactions on Information and Systems, 2019 Kung-Jui Pai +2 more
exaly +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