报告题目：Independent Spanning Trees in Networks: A Survey
时 间：2024年12月11日 (星期三) 14:00
地 点：腾讯会议（690-400-603）
主 办：数学与统计学院、分析数学及应用教育部重点实验室、福建省分析数学及应用重点实验室、福建省应用数学中心（福建师范大学）
参加对象：感兴趣的老师和研究生
报告摘要：The problem of constructing independent spanning trees (ISTs) dates back to as early as the late 1980s. Given a network G of a certain topology, the question is whether we can, as well as how to, construct a set of ISTs in G. ISTs have proven to be of great importance in many network tasks. The past decade has seen a particularly remarkable increase in the literature on ISTs, manifesting a significant growth of interest. ISTs can be classified into edge-independent spanning trees (edge-ISTs), node-independent spanning trees (nodeISTs),and completely independent spanning trees (CISTs). For a network G, node-ISTs (edge-ISTs) rooted at u are a set of spanning trees rooted at u in G such that there are no common internal nodes (edges) between u and any other node among the paths in these spanning trees. If every node in a set of node-ISTs can act as a root node, the set of trees is called CISTs. This survey aims at bringing together important works on ISTs that have been reported in the literature. It provides a historical perspective of how the field has evolved, and can serve as an integrated useful resource of references for future research on ISTs.
报告人简介：程宝雷，教授，博士生导师，CCF高级会员，CCF理论计算机科学专委会委员。2004年硕士毕业后进入苏州大学计算机科学与技术学院工作，2014年获得工学博士学位。2014年12月至2015年12月作为国家公派访问学者到美国Montclair State University进行学术交流。主持和参与完成国家自然科学基金、省部级项目、市厅级项目10多项。主要从事容错计算、图论、算法设计与分析等领域的研究工作。相关论文发表于ACM Computing Surveys, IEEE/ACM Transactions on Networking, IEEE Transactions on Computers, IEEE Transactions on Parallel and Distributed Systems, IEEE Transactions on Reliability等国际核心期刊。