时间：2016年7月3日（周日）15：00 - 16：30
地点：仓山校区成功楼603报告厅
主讲：Montclair State University, Montclair, New Jersey 王大进教授
主办：数学与计算机科学学院、福建省网络安全与密码技术重点实验室
专家简介：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 at Montclair State University, Montclair, New Jersey. He became a full professor of computer science in 2002. He received several university-level awards for his scholarly accomplishments. He 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 seventy papers in these areas. Many of his works appeared 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.
报告摘要：The crossed cube (CQn) is one of the most prominent variants of the well-known hypercube, and has been studied extensively. This talk will present algorithms that embed useful, popular structures into crossed cubes. In the first part of the talk, the notion of link permutations in a crossed cube will be introduced, and its relationship to Hamiltonian embedding discussed. An algorithm that works out a well-structured Hamiltonian cycle will be presented. The second part goes over a novel, recursive algorithm to construct two Completely Independent Spanning Trees (CISTs) in the crossed cube.