Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Windsor

$19,000.00

Efficient algorithms for graph connectivity and related problems

EF 2009-10

Résumé
Design and analysis of algorithms is a basic research area in Computer Science whose objective is to devise efficient methods (algorithms) for solving computational problems on computers. Algorithms are blue-print of computer programs. Graph algorithm is a branch of this basic research which addresses the computational complexity of graph-theoretic problems. Since any system involving a binary relation can be modeled by a graph, graph-theoretic problems arise naturally in a variety of applications/disciplines such as physics, chemistry, electrical engineering, psychology, biology and economics. Graph algorithm has thus attracted an enormous research interest in the last forty years and has become one of the most active research areas in computer science. Graph connectivity is among the most extensively studied topics in graph algorithms. This is owing to the fact that it is one of the most basic properties of graphs and is fundamental to the studies of many other important concepts/ applications such as network reliability, circuit and chip design, network flow, cluster analysis, graph optimization, quantum physics and bioinformatics. The main goal of this proposed research is to make contribution to the growing studies of algorithms for graph connectivity and related problems. Owing to the importance of graph connectivity, the results of the proposed research will have practical applications in many disciplines. As a matter of fact, some preliminary results of this proposed research had already found applications in quantum physics and bioinformatics.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
7811-2009
Name nom
Tsin, Yung
Department département
Computer Science, School of
Organization id
37
Institution établissement
University of Windsor
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2009
Award amount
19000
Program id
RGPIN
Program nane 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
9999
Area of application group en
Not available
Area of application group fr
Non disponible
Area of application en
Not available
Area of application fr
Non disponible
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
1
Nb partie
5
Application title
Efficient algorithms for graph connectivity and related problems
Keyword
NA
Application summary
Design and analysis of algorithms is a basic research area in Computer Science whose objective is to devise efficient methods (algorithms) for solving computational problems on computers. Algorithms are blue-print of computer programs. Graph algorithm is a branch of this basic research which addresses the computational complexity of graph-theoretic problems. Since any system involving a binary relation can be modeled by a graph, graph-theoretic problems arise naturally in a variety of applications/disciplines such as physics, chemistry, electrical engineering, psychology, biology and economics. Graph algorithm has thus attracted an enormous research interest in the last forty years and has become one of the most active research areas in computer science. Graph connectivity is among the most extensively studied topics in graph algorithms. This is owing to the fact that it is one of the most basic properties of graphs and is fundamental to the studies of many other important concepts/ applications such as network reliability, circuit and chip design, network flow, cluster analysis, graph optimization, quantum physics and bioinformatics. The main goal of this proposed research is to make contribution to the growing studies of algorithms for graph connectivity and related problems. Owing to the importance of graph connectivity, the results of the proposed research will have practical applications in many disciplines. As a matter of fact, some preliminary results of this proposed research had already found applications in quantum physics and bioinformatics.