On Data Center Network Architectures for Interconnecting Dual-Port Servers
From MaRDI portal
Cited in
(3)- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
- An efficient shortest-path routing algorithm in the data centre network DPillar
- Edge-disjoint Hamiltonian cycles in balanced hypercubes with applications to fault-tolerant data broadcasting
This page was built for publication: On Data Center Network Architectures for Interconnecting Dual-Port Servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982020)