时间：2013年7月11日(星期四)上午08:30
地点：仓山校区成功楼603室
主讲：苏州大学 樊建席教授
主办：数学与计算机科学学院
专家简介：樊建席，苏州大学计算机科学与技术学院教授，网络工程系主任，博士生导师。2006年获香港城市大学计算机科学专业博士学位。2002年晋升为教授。江苏省高校“青蓝工程”学术带头人。多次应邀赴香港城市大学计算机科学系合作研究。研究方向包括并行与分布式系统，多处理器互连网络，算法设计与分析，图论等。担任IEEE TC、IEEE TPDS、JPDC、 Parallel Computing、Info. Sci.等多个国际著名学术期刊的审稿人。在IEEE TC、IEEE TPDS、Info. Sci.、JPDC、Algorithm.、TCS、IPL、《计算机学报》、《计算机研究与发展》等国内外学术期刊和国际会议上共发表论文80多篇，其中被SCI收录37篇，EI收录50多篇，SCI他引次数已达到近300次，H因子已达到12。承担国家自然科学基金项目3项，省部级自然科学基金项目3项。获江苏省科学技术三等奖一项。曾在国际学术会议PAAP’09上做特邀报告，并担任PDCAT’12，ICS’12，PAAP’10，PAAP’11等多个国际学术会议的程序委员会委员。
报告摘要：Independent spanning trees (ISTs) can be used in reliable communication protocols, one-to-all broadcasting, secure message distribution in networks. However, there is a conjecture on the existence of ISTs in networks: If a graph G is n-connected (n≥1), then there are n ISTs rooted at an arbitrary vertex in G. This conjecture has remained open for n<5. As a result, researchers have been focusing on the research on the existence and/or construction of ISTs in special networks. Bijective connection networks (BC networks, in brief) are a family of interconnection networks, which include not only the known networks such as hypercubes, crossed cubes, Möbius cubes, locally twisted cubes, etc., but also many other unknown ones. In this talk, we introduce the related work on ISTs in networks and focus on the recent results on the existence and/or construction of ISTs in special BC networks. On the other hand, we also discuss the further research on ISTs in various networks.