Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of New Brunswick

$17,000.00

Applications of graph theory

FY 2007-08

Summary
I have two major projects.  One is to find as quickly as possible the minimum cycle basis of a graph.  Cycle bases are used to study cycles in networks, especially when the networks lead to sets of equations.  Smaller bases produce simpler equations to be solved.  Applications include electrical networks, structural engineering, scheduling subway systems, studying metabolic pathways, in topology.       The other project is the study of clause trees.  These give a way to represent a restricted set of logical proofs in simple diagrams, that can be represented in a computer.  Then computer programs can be written, starting from known axioms, to construct and manipulate clause trees to find proofs of theorems. Few new results have been found using such automated theorem provers yet, but such systems are used in many artifical intelligence applications.  Can clause trees be used to find proofs faster than other methods of reasoning with computers?
Program
Discovery Grants Program - Individual
Location
New Brunswick, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
5376-2006
Name nom
Horton, Joseph
Department département
Computer Science, Faculty of
Organization id
75
Institution établissement
University of New Brunswick
Province en
New Brunswick
Province fr
Nouveau-Brunswick
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2006
Award amount
17000
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
800
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information and communication services
Area of application fr
Services d'information et de télécommunications
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
Applications of graph theory
Keyword
NA
Application summary
I have two major projects.  One is to find as quickly as possible the minimum cycle basis of a graph.  Cycle bases are used to study cycles in networks, especially when the networks lead to sets of equations.  Smaller bases produce simpler equations to be solved.  Applications include electrical networks, structural engineering, scheduling subway systems, studying metabolic pathways, in topology.       The other project is the study of clause trees.  These give a way to represent a restricted set of logical proofs in simple diagrams, that can be represented in a computer.  Then computer programs can be written, starting from known axioms, to construct and manipulate clause trees to find proofs of theorems. Few new results have been found using such automated theorem provers yet, but such systems are used in many artifical intelligence applications.  Can clause trees be used to find proofs faster than other methods of reasoning with computers?
University of New Brunswick - $17,000 Grant (2007-08) | Canada Spends