Mathematical Sciences: RUI: Graph Theory and the Complexity of Graph Algorithms

这是在芮氏计划下颁发的奖项。Schmeichel教授将根据图包含的圈的长度来研究图的结构，并研究图上各种着色和通信问题的算法复杂性。图论大约可以追溯到200年前，但直到最近半个世纪，该领域才成为一个活跃、肥沃和蓬勃发展的数学分支。图是连接点(点)的线(边)的网络，因此图的语言成为描述分离对象之间相互关系的自然方式。图论是通信理论和计算机科学中最重要的工具。

This is an award made under the RUI program. Professor Schmeichel will study the structure of graphs in terms of the length of the cycles the graph contains and to examine the algorithmic complexity of various coloring and communication problems on graphs. Graph Theory goes back perhaps two hundred years, but only in the last half-century has the field become an active, fertile, and flourishing branch of mathematics. A graph is a network of lines ("edges") joining points ("vertices"), thus the language of graphs becomes a natural way of describing interrelationships among separated objects. Graph Theory figures most prominently as an essential tool in Communications Theory and Computer Science.