Research graph
References from Completely-independent spanning trees in data center network BCDC. Local targets link to admitted publications; unresolved targets remain external evidence.
Dynamic multi-objective controller placement in SD-WAN: a GMM-MARL hybrid framework
10.3390/network5040052 · 2025 · External reference
The twisted cube topology for multiprocessors: A study in network asymmetry
10.1016/0743-7315(91)90113-n · 1991 · External reference
Dirac’s condition for completely independent spanning trees
10.1002/jgt.21780 · 2014 · External reference
On k-edge-Hamilton-connected line graphs
10.1002/jgt.23252 · 2025 · External reference
Towards the independent spanning trees in the line graphs of interconnection networks
2018 · External reference
Independent spanning trees in networks: A survey
10.1145/3591110 · 2023 · External reference
The Möbius cubes
10.1109/12.381950 · 1995 · External reference
A variation on the hypercube with lower diameter
10.1109/12.102840 · 1991 · External reference
The crossed cube architecture for parallel computation
10.1109/71.159036 · 1992 · External reference
Unresolved reference
2005 · External reference
BCube: A high performance, server-centric network architecture for modular data centers
10.1145/1594977.1592577 · 2009 · External reference
DCell: A scalable and fault-tolerant network structure for data centers
10.1145/1402946.1402968 · 2008 · External reference
Completely independent spanning trees in the underlying graph of a line digraph
10.1016/s0012-365x(00)00377-0 · 2001 · External reference
Completely independent spanning trees in maximal planar graphs
2002 · External reference
Unfriendly partition conjecture holds for line graphs
2025 · External reference
On data center network architectures for interconnecting dual-port servers
10.1109/tc.2015.2389847 · 2015 · External reference
DACS: Distributed adjustable computation scheme in highly scalable data center networks based on multi-protection routing
10.1016/j.jnca.2025.104425 · 2026 · External reference
An expandable and cost-effective data center network
10.1016/j.jnca.2024.104001 · 2024 · External reference
Vertex-independent spanning trees in data center network BCDC
10.1016/j.comnet.2025.111981 · 2026 · External reference
Configuring protection routing via completely independent spanning trees in dense Gaussian on-chip networks
10.1109/tnse.2022.3140329 · 2022 · External reference
Algorithm to construct node-independent spanning trees in data center network BCDC
2022 · External reference
The existence of completely independent spanning trees for some compound graphs
10.1109/tpds.2019.2931904 · 2020 · External reference
Essential edge connectivity of line graphs
10.1016/j.disc.2018.08.029 · 2018 · External reference
Unresolved reference
2024 · External reference
An algorithm to construct completely independent spanning trees in line graphs
10.1093/comjnl/bxab120 · 2022 · External reference
Constructing completely independent spanning trees in a family of line-graph-based data center networks
2019 · External reference
An algorithm to construct independent spanning trees on parity cubes
10.1016/j.tcs.2012.08.020 · 2012 · External reference
BCDC: A high-performance, server-centric data center network
10.1007/s11390-018-1826-3 · 2018 · External reference
A note on the 4-connected line graph of a planar triangulation containing two CISTs
10.1007/s00373-025-03002-8 · 2026 · External reference
Completely independent spanning trees in the line graph of complete multipartite graphs
10.1016/j.tcs.2025.115741 · 2026 · External reference
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
10.1016/j.dam.2011.04.014 · 2011 · External reference
The locally twisted cubes
10.1080/0020716042000301752 · 2005 · External reference
HSDC: A highly scalable data center network architecture for greater incremental scalability
10.1109/tpds.2018.2874659 · 2019 · External reference
Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication
10.1007/s11227-023-05546-z · 2024 · External reference
Dirac’s condition for completely independent spanning trees
10.1002/jgt.21780 · ExternalCitation · doi-reference
On k-edge-Hamilton-connected line graphs
10.1002/jgt.23252 · ExternalCitation · doi-reference
A note on the 4-connected line graph of a planar triangulation containing two CISTs
10.1007/s00373-025-03002-8 · ExternalCitation · doi-reference
Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication
10.1007/s11227-023-05546-z · ExternalCitation · doi-reference
BCDC: A high-performance, server-centric data center network
10.1007/s11390-018-1826-3 · ExternalCitation · doi-reference
The twisted cube topology for multiprocessors: A study in network asymmetry
10.1016/0743-7315(91)90113-n · ExternalCitation · doi-reference
Vertex-independent spanning trees in data center network BCDC
10.1016/j.comnet.2025.111981 · ExternalCitation · doi-reference
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
10.1016/j.dam.2011.04.014 · ExternalCitation · doi-reference
Essential edge connectivity of line graphs
10.1016/j.disc.2018.08.029 · ExternalCitation · doi-reference
An expandable and cost-effective data center network
10.1016/j.jnca.2024.104001 · ExternalCitation · doi-reference
DACS: Distributed adjustable computation scheme in highly scalable data center networks based on multi-protection routing
10.1016/j.jnca.2025.104425 · ExternalCitation · doi-reference
An algorithm to construct independent spanning trees on parity cubes
10.1016/j.tcs.2012.08.020 · ExternalCitation · doi-reference
Completely independent spanning trees in the line graph of complete multipartite graphs
10.1016/j.tcs.2025.115741 · ExternalCitation · doi-reference
Completely independent spanning trees in the underlying graph of a line digraph
10.1016/s0012-365x(00)00377-0 · ExternalCitation · doi-reference
The locally twisted cubes
10.1080/0020716042000301752 · ExternalCitation · doi-reference
An algorithm to construct completely independent spanning trees in line graphs
10.1093/comjnl/bxab120 · ExternalCitation · doi-reference
A variation on the hypercube with lower diameter
10.1109/12.102840 · ExternalCitation · doi-reference
The Möbius cubes
10.1109/12.381950 · ExternalCitation · doi-reference
The crossed cube architecture for parallel computation
10.1109/71.159036 · ExternalCitation · doi-reference
On data center network architectures for interconnecting dual-port servers
10.1109/tc.2015.2389847 · ExternalCitation · doi-reference
Configuring protection routing via completely independent spanning trees in dense Gaussian on-chip networks
10.1109/tnse.2022.3140329 · ExternalCitation · doi-reference
HSDC: A highly scalable data center network architecture for greater incremental scalability
10.1109/tpds.2018.2874659 · ExternalCitation · doi-reference
The existence of completely independent spanning trees for some compound graphs
10.1109/tpds.2019.2931904 · ExternalCitation · doi-reference
DCell: A scalable and fault-tolerant network structure for data centers
10.1145/1402946.1402968 · ExternalCitation · doi-reference
BCube: A high performance, server-centric network architecture for modular data centers
10.1145/1594977.1592577 · ExternalCitation · doi-reference
Independent spanning trees in networks: A survey
10.1145/3591110 · ExternalCitation · doi-reference
Dynamic multi-objective controller placement in SD-WAN: a GMM-MARL hybrid framework
10.3390/network5040052 · ExternalCitation · doi-reference
