Mathematical Sciences: Graph Theory and The Complexity of Graph Algorithms

该奖项支持图论的研究， 圣何塞州立大学的爱德华·舒梅切尔教授。博士 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.