Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication.
Huanwen ZhangYan WangJianxi FanYuejuan HanBaolei ChengPublished in: J. Supercomput. (2024)
Keyphrases
- fault tolerant
- edge disjoint
- spanning tree
- interconnection networks
- edge weights
- fault tolerance
- minimum spanning trees
- undirected graph
- total length
- weighted graph
- minimum spanning tree
- distributed systems
- computer networks
- minimum cost
- load balancing
- high availability
- communication networks
- state machine
- network structure
- running times
- safety critical
- multi dimensional
- metadata
- social networks
- graph structure
- mobile agent system