Pages that link to "Item:Q2286061"
From MaRDI portal
The following pages link to Constructing dual-CISTs of DCell data center networks (Q2286061):
Displaying 13 items.
- The restricted \(h\)-connectivity of the data center network DCell (Q260051) (← links)
- An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← links)
- Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs (Q2009644) (← links)
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes (Q2043017) (← links)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
- Constructing dual-CISTs of folded divide-and-swap cubes (Q2219061) (← links)
- The vertex-pancyclicity of data center networks (Q2220882) (← links)
- Reliability analysis based on the dual-CIST in shuffle-cubes (Q2242055) (← links)
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5918548) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5925687) (← links)
- A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks (Q6569892) (← links)
- Two-disjoint-cycle-cover pancyclicity of data center networks (Q6570972) (← links)