LTQ_n admits floor(n/2) completely edge-independent spanning trees via a constructive algorithm.
Distributed calculation of edge-disjoint spanning trees for robustify- ing distributed algorithms against Man-in-the-Middle attacks
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Review summarizing innovations in phase-change memory energy efficiency via material scaling and thermal confinement, with discussion of attojoule-scale theoretical limits constrained by parasitics.
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.
-
Energy and Scaling Limits of Phase-Change Memory
Review summarizing innovations in phase-change memory energy efficiency via material scaling and thermal confinement, with discussion of attojoule-scale theoretical limits constrained by parasitics.