Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Alberta

$19,000.00

Structured graph classes: characterizations, algorithms, and complexity

EF 2007-08

Résumé
Many problems in graph theory are known to be NP-hard, which means that they likely cannot be solved by efficient algorithms. However, it is sometimes possible to construct an efficient algorithm for such a problem, if only a subset of all graphs needs to be considered. The study of particular classes of graphs is usually motivated by theoretical considerations, relationships to previous work, and/or applications. Such graph classes are typically defined in terms of forbidden substructures,  decomposition schemes, vertex orderings, or as intersection (or other) graphs of subsets of a set. The definition usually implies additional properties and structure, which in turn provide clues about how problems may be solved efficiently for those graphs. Most of my research involves characterizing properties of graph classes, and using those properties to design polynomial time algorithms and to prove complexity results, for various problems on structured graphs. The goal is to understand the interplay between problems and graph properties, and to identify relationships that lead to efficient algorithms.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
9217-2006
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
2007
Competition year année de concours
2006
Award amount
19000
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
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
Structured graph classes: characterizations, algorithms, and complexity
Keyword
NA
Application summary
Many problems in graph theory are known to be NP-hard, which means that they likely cannot be solved by efficient algorithms. However, it is sometimes possible to construct an efficient algorithm for such a problem, if only a subset of all graphs needs to be considered. The study of particular classes of graphs is usually motivated by theoretical considerations, relationships to previous work, and/or applications. Such graph classes are typically defined in terms of forbidden substructures,  decomposition schemes, vertex orderings, or as intersection (or other) graphs of subsets of a set. The definition usually implies additional properties and structure, which in turn provide clues about how problems may be solved efficiently for those graphs. Most of my research involves characterizing properties of graph classes, and using those properties to design polynomial time algorithms and to prove complexity results, for various problems on structured graphs. The goal is to understand the interplay between problems and graph properties, and to identify relationships that lead to efficient algorithms.