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