A partitioning-and-rotation construction yields two CISTs in dense Gaussian networks with at least 33% lower average maximum delivery steps than prior methods.
In: 2020 IEEE Asian Solid-State Circuits Conference (A-SSCC), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.