Dr. Bruce Reed
Fellow
Current Employer
McGill University
Election Year
2009
Academy
Academy of Science
Discipline
Mathematics and Computer Sciences
Department
School of Computer Science
Keywords
Combinatorics, probabilistic methods, algorithmic graph theory
Bruce Reed is a mathematician and theoretical computer scientist who has made deep contributions in the areas of discrete mathematics and probabilistic combinatorics. Reed is well known for his profound and influential work on graph colouring, the perfect graph conjecture, the theory of graph minors, and the analysis of random trees, graphs and network models.
------------------
REED, Bruce –School of Computer Science, McGill University
Bruce Reed is a mathematician and theoretical computer scientist who has made deep contributions in the areas of discrete mathematics and probabilistic combinatorics. He has settled long-standing open problems in graph theory, including Gallai's conjecture, from the 1960's, on packing directed circuits. Reed is well known for his profound and influential work on graph colouring, the perfect graph conjecture, the theory of graph minors, and the analysis of random trees, graphs and network models. In 2002, Reed and Molloy published the acclaimed research monograph, "Graph Colouring and the Probabilistic Method".
------------------
REED, Bruce –School of Computer Science, McGill University
Bruce Reed is a mathematician and theoretical computer scientist who has made deep contributions in the areas of discrete mathematics and probabilistic combinatorics. He has settled long-standing open problems in graph theory, including Gallai's conjecture, from the 1960's, on packing directed circuits. Reed is well known for his profound and influential work on graph colouring, the perfect graph conjecture, the theory of graph minors, and the analysis of random trees, graphs and network models. In 2002, Reed and Molloy published the acclaimed research monograph, "Graph Colouring and the Probabilistic Method".
3633