A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
From MaRDI portal
Publication:2110363
DOI10.1016/j.tcs.2022.11.023OpenAlexW4309942225WikidataQ123330108 ScholiaQ123330108MaRDI QIDQ2110363
Baolei Cheng, Zhiyong Pan, Jianxi Fan, Xiajing Li, Yan Wang
Publication date: 21 December 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.023
line graphdata center networkconditional bijective connection networksedge independent spanning trees
Cites Work
- A note on edge-disjoint Hamilton cycles in line graphs
- A comment on ``Independent spanning trees in crossed cubes
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Independent spanning trees on even networks
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Independent spanning trees on twisted cubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- The multi-tree approach to reliability in distributed networks
- Independent trees in planar graphs
- Reliable broadcasting in product networks
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- Structural properties of subdivided-line graphs
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- Construction independent spanning trees on locally twisted cubes in parallel
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- On Data Center Network Architectures for Interconnecting Dual-Port Servers
- Four Edge-Independent Spanning Trees
- Three tree-paths
- Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks
- Treewidth of the Line Graph of a Complete Graph
- Independent spanning trees in crossed cubes
This page was built for publication: A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks