报告题目：Constructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networks
时间：2023-05-29 (星期一) 16:00-18:00
The Completely Independent Spanning Trees (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 talk, we introduce an algorithm to construct the optimal (i.e., maximal) number of CISTs in the line graph of the complete graph Kn(denoted L(Kn), for n ≥ 4).
Dajin Wang received the B.Eng. degree in computer engineering from Shanghai University of Science and Technology in 1982, and the Ph.D. degree in computer science from Stevens Institute of Technology in 1990. Since 1990 he has been with the Department of Computer Science (now the School of Computing) at Montclair State University, New Jersey, USA, where he has been a full professor of Computer Science since 2002. He has received college and university level awards for his scholarly accomplishments, has held visiting positions in other universities, and has consulted in industry. His main research interests include interconnection networks, fault tolerant computing, algorithmic robotics, parallel processing, and wireless ad hoc and sensor networks. He has published over one hundred papers in these areas, with many appearing in premier journals including IEEE Transactions on Computers, IEEE TPDS, IEEE Transactions on Systems, Man and Cybernetics, IEEE Transactions on Reliability, J. of Parallel and Distributed Computing, and Parallel Computing. He has served on the program committees of influential conferences. He served as an Associate Editor of IEEE Transactions on Parallel and Distributed Systems from 2010 to 2014.