Mathematical Sciences: Graph Theory and The Complexity of Graph Algorithms

该奖项支持圣何塞州立大学Edward Schmeichel教授在图论方面的研究。Schmeichel博士将通过检查图可能包含的最长周期的长度，以及通过研究图和网络上各种问题的算法复杂性来研究图的结构。图论的起源可以追溯到大约200年前，但主要是在过去的半个世纪里，这个领域才成为数学中一个活跃、肥沃和繁荣的分支。图是由线（“边”）连接点（“顶点”）组成的网络，图论的应用不仅在通信理论领域，而且在数学的许多领域，无论是纯数学还是应用数学，以及理论计算机科学中都有广泛的应用。

This award supports the research in Graph Theory of Professor Edward Schmeichel of San Jose State University. Dr. Schmeichel will investigate the structure of graphs by examining the length of the longest cycle that a graph may contain, and by studying the algorithmic complexity of various problems on graphs and networks. The beginnings of Graph Theory go back perhaps two hundred years, but it is mostly in the last half-century that the field has become an active, fertile, and flourishing branch of mathematics. A graph is a network of lines ("edges") joining points ("vertices"), and the uses of Graph Theory abound not only in the field of Communications Theory but in surprisingly many parts of Mathematics, both pure and applied, as well as Theoretical Computer Science.