Constructing edge-disjoint spanning trees in several cube- based networks with applications to edge fault-tolerant communication

Zhang H, Wang Y , Fan J, Han Y , Cheng B · DOI 10.1007/s11227-023-05546-z

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DC · 2024-01-03 · unverdicted · novelty 5.0

LTQ_n admits floor(n/2) completely edge-independent spanning trees via a constructive algorithm.

Showing 1 of 1 citing paper.

On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes cs.DC · 2024-01-03 · unverdicted · none · ref 18
LTQ_n admits floor(n/2) completely edge-independent spanning trees via a constructive algorithm.