LTQ_n admits floor(n/2) completely edge-independent spanning trees via a constructive algorithm.
Edge-disjoint spanning trees on the star network with applications to fault toler- ance
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2verdicts
UNVERDICTED 2representative citing papers
A partitioning-and-rotation construction yields two CISTs in dense Gaussian networks with at least 33% lower average maximum delivery steps than prior methods.
citing papers explorer
-
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
LTQ_n admits floor(n/2) completely edge-independent spanning trees via a constructive algorithm.
-
An Efficient Construction of Completely Independent Spanning Trees in Dense Gaussian Networks
A partitioning-and-rotation construction yields two CISTs in dense Gaussian networks with at least 33% lower average maximum delivery steps than prior methods.