Claims ratio-independent decomposition of every six-regular simple non-axis Eisenstein-Jacobi network into three edge-disjoint Hamiltonian cycles with optimal ordered local-switch cost via unit-parallelogram exchanges.
Panconnectivity algorithm for Eisenstein–Jacobi networks.Kuwait J
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
-
Ratio-Independent Three-Cycle Decomposition with Optimal Ordered Local-Switch Cost in Six-Regular Non-Axis Eisenstein--Jacobi Networks
Claims ratio-independent decomposition of every six-regular simple non-axis Eisenstein-Jacobi network into three edge-disjoint Hamiltonian cycles with optimal ordered local-switch cost via unit-parallelogram exchanges.