Grant: Discovery Grants Program - Individual
University of Victoria
$15,000.00
Algorithmic and Structural Graph Theory
EF 2015-16
Résumé
The proposed research lies in combinatorics, a branch of mathematics which deals with
mostly finite objects and is closely related to computer science. Problems involving
scheduling of tasks, communication networks, VLSI and manufacturing systems, etc.
can be modelled in this format. Efficient (computational) solutions of problems in combinatorics
can often be derived from an understanding of these models. The research activities include
establishing mathematical results concerning the structure of these models and using
the results to find (or improve) the solutions (or algorithms) to mathematical and computational
problems.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
203191-2012
Name nom
Huang, Jing
Department département
Mathematics and Statistics
Organization id
7
Institution établissement
University of Victoria
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2012
Award amount
15000
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
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
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
Algorithmic and Structural Graph Theory
Keyword
NSERC
Application summary
The proposed research lies in combinatorics, a branch of mathematics which deals with
mostly finite objects and is closely related to computer science. Problems involving
scheduling of tasks, communication networks, VLSI and manufacturing systems, etc.
can be modelled in this format. Efficient (computational) solutions of problems in combinatorics
can often be derived from an understanding of these models. The research activities include
establishing mathematical results concerning the structure of these models and using
the results to find (or improve) the solutions (or algorithms) to mathematical and computational
problems.