课题基金 / 基金详情

Graph classes: Structure, algorithms, and complexity

Graph classes: Structure, algorithms, and complexity
图类:结构、算法和复杂性
批准号:
9217-2011
负责人:
Stewart, Lorna
金额:
$1.75万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2011
资助国家:
加拿大
项目状态:
已结题
起止时间:
2011-01-01 至 2012-12-31

项目摘要

项目成果

Stewart, Lorna的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
Many graph problems are known to be NP-hard, which means that they likely cannot be solved in a reasonable amount of time even by a fast computer. However, it is sometimes possible to construct an efficient algorithm for such a problem if something is known in advance about the kinds of graphs that need to be handled. In my research, I consider graph classes that arise in applications or that give insight into a problem's solution, and make use of their properties to design polynomial time algorithms, or to prove that such an algorithm is unlikely to exist. The goal is to understand the interplay between problems and graph properties, and to identify relationships between graph classes and problems that lead to efficient algorithms.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Algorithms and complexity for structured graph classes
  • 批准号:
    RGPIN-2016-04849
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.6万
  • 财政年份:
    2022
  • 负责人:
    Stewart, Lorna
  • 依托单位:
Algorithms and complexity for structured graph classes
  • 批准号:
    RGPIN-2016-04849
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.6万
  • 财政年份:
    2021
  • 负责人:
    Stewart, Lorna
  • 依托单位:
Algorithms and complexity for structured graph classes
  • 批准号:
    RGPIN-2016-04849
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.6万
  • 财政年份:
    2019
  • 负责人:
    Stewart, Lorna
  • 依托单位:
Algorithms and complexity for structured graph classes
  • 批准号:
    RGPIN-2016-04849
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.6万
  • 财政年份:
    2018
  • 负责人:
    Stewart, Lorna
  • 依托单位:
海外基金