课题基金 / 基金详情

DMS-EPSRC: The Power of Graph Structure

DMS-EPSRC: The Power of Graph Structure
DMS-EPSRC:图结构的力量
批准号:
2120644
负责人:
Maria Chudnovsky
金额:
$37.5万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2021
资助国家:
美国
项目状态:
已结题
起止时间:
2021-06-01 至 2024-05-31

项目摘要

项目成果

Maria Chudnovsky的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This research project is jointly supported by NSF in the US and EPSRC in the UK. The PIs, one in the US and the other in UK, will work on questions at the interface of graph theory and theoretical computer science. The line of inquiry that guides this research project is the following: what is the global difference between general graphs and graphs that do not contain particular configurations (known as an induced subgraphs)? This is a fundamental question and the mathematical understanding of it is very limited. The project will study the impact of the absence of those configurations on algorithmic properties of the graph: what questions (that are known to be difficult in general) become tractable if we are given this kind of additional information about the input? This project will also provide graduate student training both in the US and UK.In recent years significant progress has been made in the theoretical computer science community toward designing methods that address NP-complete problems in graph theory when certain restrictions are placed on the input. These are beautiful and powerful results that have significantly deepened the understanding of the limits of efficient algorithms. This project aims to combine the power of structural graph theory with these recent developments and apply them to several longstanding open questions. The project will study the impact of excluding an induced subgraph on the complexity of such well-known algorithmic tasks as finding the chromatic number, the stability number, and the clique number of a graph (as well as their weighted analogues). Progress on any of these aspects will advance the understanding of the structure of families of graphs defined by forbidden induced subgraphs, contribute to answering important open questions, and have significant algorithmic consequences.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(5)
专著(0)
科研奖励(0)
会议论文
Stable sets in flag spheres
旗球中的稳定集
DOI: 10.1016/j.ejc.2023.103699
发表时间: 2023
期刊: European Journal of Combinatorics
影响因子: 1
作者: [Chudnovsky, Maria, Nevo, Eran]
通讯作者: Nevo, Eran
DOI: 10.1016/j.jctb.2022.05.009
发表时间: 2022
期刊: Series B
影响因子: --
作者: [Abrishami, Tara, Chudnovsky, Maria, Vušković, Kristina]
通讯作者: Vušković, Kristina
DOI: 10.19086/aic.2022.6
发表时间: 2022
期刊: Advances in Combinatorics
影响因子: --
作者: [Chudnovsky, Maria, Abrishami, Tara, Hajebi, Sepehr, Spirkl, Sophie]
通讯作者: Spirkl, Sophie
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws
无长诱导爪有界度图中最大独立集的多项式时间算法
DOI: --
发表时间: 2022
期刊: 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
影响因子: --
作者: [Chudnovsky, M. with]
通讯作者: Chudnovsky, M. with
Forbidding Induced Subgraphs: Decompositions, Coloring and Algorithms
  • 批准号:
    2348219
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $36.0万
  • 财政年份:
    2024
  • 负责人:
    Maria Chudnovsky
  • 依托单位:
Forbidding Induced Subgraphs: Structure and Properties
  • 批准号:
    1763817
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $21.0万
  • 财政年份:
    2018
  • 负责人:
    Maria Chudnovsky
  • 依托单位:
Collaborative Research: cliques, stable sets and approximate structure
  • 批准号:
    1550991
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $21.02万
  • 财政年份:
    2015
  • 负责人:
    Maria Chudnovsky
  • 依托单位:
Collaborative Research: cliques, stable sets and approximate structure
  • 批准号:
    1265803
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $35.0万
  • 财政年份:
    2013
  • 负责人:
    Maria Chudnovsky
  • 依托单位:
海外基金