Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Alberta

$24,000.00

Graph classes: Structure, algorithms, and complexity

FY 2012-13

Summary
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.
Program
Discovery Grants Program - Individual
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
9217-2011
Name nom
Stewart, Lorna
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2011
Award amount
24000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
2
Nb partie
5
Application title
Graph classes: Structure, algorithms, and complexity
Keyword
NSERC
Application summary
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.