学术讲座

首页 >> 学术讲座

理学院2018-2019学年秋季第二周学术报告(4)

发布时间:2018-09-13

学 术 报 告

 

报告题目:Queue Layouts on Some Interconnection Networks

 

报告学者:Jou-Ming Chang 教授

 

报告者单位 Taipei University of Business (台北商业大学)

 

报告时间2018年9月14日下午4:00-5:30

 

报告地点学生活动中心1005

 

摘要:A queue layout of a graph G consists of a linear order of its vertices, and a partition of its edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout is called the queuenumber of G. Queue layouts were first introduced by Heath et al. There are many applications of queue layout in computer science, including sorting permutations, parallel process scheduling, matrix computations and graph drawing. In particular, queue layouts of interconnection networks have applications to the Diogenes approach to testable fault-tolerant arrays of processors. In this talk, we present some upper bounds of queuenumber on some interconnection networks such as hypercubes, k-ary n-cubes and folded hypercubes.

 

报告人简介: Jou-Ming Chang. Institute of Information and Decision Sciences, Taipei University of Business

 

主办教师:郝荣霞

欢迎广大同学老师积极踊跃参加!