Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks

DOI10.1109/TC.2021.3077587MaRDI QIDQ5095079zbMATH OpenOpenAlexFDO

Authors Yifeng Wang, Baolei Cheng, Yu Qian, Dajin 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

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5095079)