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

IEEE Transactions on Computers(2022)

引用 8|浏览15
暂无评分
摘要
The past decade has seen growing importance being attached to the Completely Independent Spanning Trees (CISTs). The CISTs can facilitate many network functionalities, and the existence and construction schemes of CISTs in various networks can be an indicator of the network's robustness. In this paper, we establish the number of CISTs that can be constructed in the line graph of the ...
更多
查看译文
关键词
Data centers,Bipartite graph,Data models,Color,Ink,Computer science,Terminology
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要