Algorithms and structure in graphs and matroids

图和拟阵中的算法和结构

• 批准号: RGPIN-2015-04061
• 负责人: Guenin, Bertrand
• 金额: $ 3.13万
• 依托单位: University of Waterloo
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2017
• 资助国家: 加拿大
• 起止时间: 2017-01-01 至 2018-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=635127
• 关键词: Algorithms; structure; graphs; matroids

This research proposal falls into the context of optimization, combinatorics, and theoretical computer science. We will investigate common generalizations to flows and graphs colouring. We will study the structure of certain minor closed classes of graphs and binary matroids with the aim of finding efficient recognition algorithms. The following is a summary of the projects in the proposal.

本研究计划涉及最优化、组合学和理论计算机科学。我们将研究流和图形着色的一般概括。我们将研究图和二拟阵的某些小闭类的结构，目的是寻找有效的识别算法。以下是提案中项目的摘要。