Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks
From MaRDI portal
Publication:5095079
DOI10.1109/TC.2021.3077587OpenAlexW3158502871MaRDI QIDQ5095079
Yifeng Wang, Baolei Cheng, Yu Qian, Da-Jin Wang
Publication date: 5 August 2022
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2021.3077587
Related Items (2)
Completely independent spanning trees in line graphs ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
This page was built for publication: Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks