Reference number : GC-2017-Q1-01999, amendment number : , agreement type : G, recipient legal name : MacGillivray, Gary (University of Victoria), recipient country : CA, recipient province : nan, recipient city : British Columbia|Colombie-Britannique, recipient postal code : nan, program name english : Discovery Grants Program - Individual, program name french : Programme de subventions à la découverte - individuelles, program purpose english : We propose a continuation of our long-term research program involving the study of graph colourings and homomorphisms, which have applications in scheduling and logistics, dominating sets, which have applications in locating resources and networks, and discrete-time graph processes, which have applications ranging from network security to automated cleaning of networks of pipes. An important feature of the study proposed is that as much of it as possible is to be carried out in such a way that development opportunities for undergraduate students, graduate students, post-doctoral fellows and young researchers are generated. 
 
A common feature to all of the topics we propose to study is time. We are looking for either computationally efficient solutions to the problems in question (solvable by a computer in a reasonable amount of time), or a demonstration that no such solution is likely to exist. When the latter situation arises, we look for approximate solutions that can be found efficiently or special cases of the problem that admit such solutions., program purpose french : We propose a continuation of our long-term research program involving the study of graph colourings and homomorphisms, which have applications in scheduling and logistics, dominating sets, which have applications in locating resources and networks, and discrete-time graph processes, which have applications ranging from network security to automated cleaning of networks of pipes. An important feature of the study proposed is that as much of it as possible is to be carried out in such a way that development opportunities for undergraduate students, graduate students, post-doctoral fellows and young researchers are generated. 
 
A common feature to all of the topics we propose to study is time. We are looking for either computationally efficient solutions to the problems in question (solvable by a computer in a reasonable amount of time), or a demonstration that no such solution is likely to exist. When the latter situation arises, we look for approximate solutions that can be found efficiently or special cases of the problem that admit such solutions., agreement title english : Combinatorial problems from the perspective of algorithms and complexity, agreement title french : Combinatorial problems from the perspective of algorithms and complexity, agreement number : RGPIN, agreement value : 115000.0, agreement start date : 2017-05-10, agreement end date : nan, description english : nan, description french : nan, expected results english : nan, expected results french : nan, additional information english : Grant or Award spanning more than one fiscal year. (2017-2018 to 2022-2023), additional information french : Subvention ou bourse octroyée s'appliquant à plus d'un exercice financier. (2017-2018 à 2022-2023), owner organization : nserc-crsng, owner organization title : Natural Sciences and Engineering Research Council of Canada | Conseil de recherches en sciences naturelles et en génie du Canada