课题基金 / 基金详情

Mathematical Sciences: Graph Theory and The Complexity of Graph Algorithms

Mathematical Sciences: Graph Theory and The Complexity of Graph Algorithms
数学科学:图论和图算法的复杂性
批准号:
8904520
负责人:
Edward Schmeichel
金额:
$4.87万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
1989
资助国家:
美国
项目状态:
已结题
起止时间:
1989-06-01 至 1992-05-31

项目摘要

项目成果

Edward Schmeichel的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
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.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Mathematical Sciences: RUI: Graph Theory and the Complexity of Graph Algorithms
  • 批准号:
    9206991
  • 项目类别:
    Standard Grant
  • 资助金额:
    $5.64万
  • 财政年份:
    1992
  • 负责人:
    Edward Schmeichel
  • 依托单位:
国内基金
海外基金
Handbook of the Mathematics of the Arts and Sciences的中文翻译
  • 批准号:
    12226504
  • 项目类别:
    数学天元基金项目
  • 资助金额:
    20.0万元
  • 批准年份:
    2022
  • 负责人:
    黄朝凌
  • 依托单位:
SCIENCE CHINA: Earth Sciences
Journal of Environmental Sciences
SCIENCE CHINA Information Sciences