LTQ_n admits floor(n/2) completely edge-independent spanning trees via a constructive algorithm.
An efficient fault-tolerant routing algorithm in bijective connection net- works with restricted faulty edges
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
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.