| Graph colouring model for scheduling problems【2012.11.29 10:00am,S712】 |
| Date:15-12-2012 Page Views: |
|
 |
Text Size: A A A |
|
|
|
2012-11-19
Colloquia & Seminars
|
Speaker |
朱绪鼎 浙江师大教授，“千人计划”入选者 |
|
Title |
Graph colouring model for scheduling problems |
|
Time |
2012.11.29 10:00am |
|
Venue |
S712 |
|
Abstract |
Graph colourings provide good models for many scheduling problems.Different scheduling problems lead to different graph colouring concepts.This talk will introduce the concept of circular colouring of graphs, which provides a model for many periodic scheduling problems. I will explain how the model works, and then survey recent results in the study of circular colouring of graphs. |
|
Affiliation |
1959年 4月出生于湖北仙桃，曾担任台湾中山大学西湾讲座教授，第三批国家“千人计划”入选者。作为图论与组合优化研究领域的著名专家，朱绪鼎在图的染色理论、结构分析、演算法等领域做出了杰出的贡献，取得一系列重大研究成果，特别是创新发展了图的圆染色理论，使得该方向已成为当前国内外研究的热点之一。朱绪鼎曾先后在国际重要学术刊物上发表SCI研究论文130余篇，论文被同行引用1000余次。2007年，在ISI公布的、有全球900多位数学家入选的世界数学家被引用次数排名中，位列第67名。 |
|
|
|
|
