Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Simon Fraser University

$25,000.00

Studies in graphs and matroids

FY 2010-11

Summary
Graphs are mathematical abstractions which are used to model structures exhibiting a ""discrete"" nature. Examples include communication and transportation networks, crew scheduling, vehicle routing, computer chip design and digital devices. Matroids are structures which are more abstract than graphs, which are vital to the understanding of geometry, rigidity, and good algorithms for optimization problems. My research is aimed at understanding the fundamental properties of such structures, with an aim toward optimizing various parameters of interest. For example, the problem of assigning shows to venues at a film festival can be modeled as a type of graph colouring problem. Theoretical considerations of the associated family of graphs can lead to improved scheduling algorithms. With the advent of digital communication, such studies are vital to the efficient design and deployment of arising technologies.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
105452-2007
Name nom
Goddyn, Luis
Department département
Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
Competition year année de concours
2007
Award amount
25000
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
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Partie
4
Nb partie
5
Application title
Studies in graphs and matroids
Keyword
NSERC
Application summary
Graphs are mathematical abstractions which are used to model structures exhibiting a ""discrete"" nature. Examples include communication and transportation networks, crew scheduling, vehicle routing, computer chip design and digital devices. Matroids are structures which are more abstract than graphs, which are vital to the understanding of geometry, rigidity, and good algorithms for optimization problems. My research is aimed at understanding the fundamental properties of such structures, with an aim toward optimizing various parameters of interest. For example, the problem of assigning shows to venues at a film festival can be modeled as a type of graph colouring problem. Theoretical considerations of the associated family of graphs can lead to improved scheduling algorithms. With the advent of digital communication, such studies are vital to the efficient design and deployment of arising technologies.