Reed, Bruce A.
Overview
Works:  22 works in 102 publications in 2 languages and 1,240 library holdings 

Roles:  Editor, Author, Creator 
Publication Timeline
.
Most widely held works by
Bruce A Reed
Recent advances in algorithms and combinatorics by
Bruce A Reed(
)
23 editions published between 2002 and 2005 in English and held by 529 WorldCat member libraries worldwide
Combinatorics is one of the fastest growing fields of mathematics. One reason for this is because many practical problems can be modeled and then efficiently solved using combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has no direct application to applied problems. This book highlights a few of the exciting recent developments in algorithmic combinatorics, including the search for patterns in DNA and protein sequences, the theory of semidefinite programming and its role in combinatorial optimization, and the algorithmic aspects of tree decompositions and it's applications to the theory of databases, code optimization, and bioinformatics. Claudia LinharesSales is Assistant Professor of Computer Science at the Federal University of Cear, Brazil. Bruce Reed is Canada Research Chair in Graph Theory at the School of Computer Science of McGill Univeristy
23 editions published between 2002 and 2005 in English and held by 529 WorldCat member libraries worldwide
Combinatorics is one of the fastest growing fields of mathematics. One reason for this is because many practical problems can be modeled and then efficiently solved using combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has no direct application to applied problems. This book highlights a few of the exciting recent developments in algorithmic combinatorics, including the search for patterns in DNA and protein sequences, the theory of semidefinite programming and its role in combinatorial optimization, and the algorithmic aspects of tree decompositions and it's applications to the theory of databases, code optimization, and bioinformatics. Claudia LinharesSales is Assistant Professor of Computer Science at the Federal University of Cear, Brazil. Bruce Reed is Canada Research Chair in Graph Theory at the School of Computer Science of McGill Univeristy
Graph colouring and the probabilistic method by
Michael S Molloy(
Book
)
13 editions published between 2001 and 2010 in English and held by 379 WorldCat member libraries worldwide
Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality. The topics covered include: Kahn's proofs that the GoldbergSeymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and nearoptimal colourings. This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability
13 editions published between 2001 and 2010 in English and held by 379 WorldCat member libraries worldwide
Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality. The topics covered include: Kahn's proofs that the GoldbergSeymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta) colouring; algorithmic variants of the Local Lemma which permit the efficient construction of many optimal and nearoptimal colourings. This begins with a gentle introduction to the probabilistic method and will be useful to researchers and graduate students in graph theory, discrete mathematics, theoretical computer science and probability
Perfect graphs by
Jorge L Ramírez Alfonsin(
Book
)
8 editions published in 2001 in English and held by 190 WorldCat member libraries worldwide
8 editions published in 2001 in English and held by 190 WorldCat member libraries worldwide
Probabilistic methods for algorithmic discrete mathematics by
M Habib(
)
2 editions published in 1998 in English and held by 59 WorldCat member libraries worldwide
The book gives an accessible account of modern pro babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included:  a simple treatment of Talagrand inequalities and their applications  an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms  a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods)  a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be finetuned to explit the structure of the underlying graph  a succinct treatment of randomized algorithms and derandomization techniques
2 editions published in 1998 in English and held by 59 WorldCat member libraries worldwide
The book gives an accessible account of modern pro babilistic methods for analyzing combinatorial structures and algorithms. Each topic is approached in a didactic manner but the most recent developments are linked to the basic ma terial. Extensive lists of references and a detailed index will make this a useful guide for graduate students and researchers. Special features included:  a simple treatment of Talagrand inequalities and their applications  an overview and many carefully worked out examples of the probabilistic analysis of combinatorial algorithms  a discussion of the "exact simulation" algorithm (in the context of Markov Chain Monte Carlo Methods)  a general method for finding asymptotically optimal or near optimal graph colouring, showing how the probabilistic method may be finetuned to explit the structure of the underlying graph  a succinct treatment of randomized algorithms and derandomization techniques
On splitable sets by
William R Pulleyblank(
Book
)
7 editions published in 1992 in English and German and held by 10 WorldCat member libraries worldwide
7 editions published in 1992 in English and German and held by 10 WorldCat member libraries worldwide
A bound on the total chromatic number by
Michael S Molloy(
Book
)
4 editions published in 1996 in English and held by 9 WorldCat member libraries worldwide
4 editions published in 1996 in English and held by 9 WorldCat member libraries worldwide
When is the assignment bound tight for the asymmetric traveling salesman problem? by
Alan Frieze(
Book
)
6 editions published in 1992 in English and German and held by 8 WorldCat member libraries worldwide
Abstract: "We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume here that the costs are given by an n X n matrix M whose entries are independently and identically distributed. We focus on the relationship between Pr(ATSP(M) = AP(M)) and the probability p[subscript n] that any particular entry is zero. If np[subscript n] > [infinity] with n then we prove that ATSP(M) = AP(M) with probability 1o(1). This is shown to be best possible in the sense that if np(n) > c, c> 0 and constant, then Pr(ATSP(M) = AP(M)) <1  [phi](c) for some positive function [phi]. Finally, if np[subscript n] > 0 then Pr(ATSP(M) = AP(M)) > 0
6 editions published in 1992 in English and German and held by 8 WorldCat member libraries worldwide
Abstract: "We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume here that the costs are given by an n X n matrix M whose entries are independently and identically distributed. We focus on the relationship between Pr(ATSP(M) = AP(M)) and the probability p[subscript n] that any particular entry is zero. If np[subscript n] > [infinity] with n then we prove that ATSP(M) = AP(M) with probability 1o(1). This is shown to be best possible in the sense that if np(n) > c, c> 0 and constant, then Pr(ATSP(M) = AP(M)) <1  [phi](c) for some positive function [phi]. Finally, if np[subscript n] > 0 then Pr(ATSP(M) = AP(M)) > 0
Path, stars, and the number three : the grunge by
Bruce A Reed(
Book
)
4 editions published between 1989 and 1991 in English and German and held by 7 WorldCat member libraries worldwide
4 editions published between 1989 and 1991 in English and German and held by 7 WorldCat member libraries worldwide
Star arboricity by
Noga Alon(
Book
)
5 editions published between 1988 and 1989 in German and English and held by 7 WorldCat member libraries worldwide
5 editions published between 1988 and 1989 in German and English and held by 7 WorldCat member libraries worldwide
A semistrong perfect graph theorem by
Bruce A Reed(
)
3 editions published between 1986 and 1987 in English and held by 6 WorldCat member libraries worldwide
3 editions published between 1986 and 1987 in English and held by 6 WorldCat member libraries worldwide
Brazilian Symposium on Graphs, Algorithms and Combinatorics : [... held in Fortaleza, Ceará, Brazil, 2001] by
Algorithms and Combinatorics (2001, Fortaleza) Brazilian Symposium on Graphs(
Book
)
3 editions published in 2004 in English and held by 6 WorldCat member libraries worldwide
3 editions published in 2004 in English and held by 6 WorldCat member libraries worldwide
Mick gets some (the odds are on his side) by
Vašek Chvátal(
Book
)
3 editions published in 1992 in English and German and held by 5 WorldCat member libraries worldwide
3 editions published in 1992 in English and German and held by 5 WorldCat member libraries worldwide
Finding approximate seperators and computing tree width quickly by
Bruce A Reed(
Book
)
4 editions published between 1991 and 1992 in English and German and held by 4 WorldCat member libraries worldwide
4 editions published between 1991 and 1992 in English and German and held by 4 WorldCat member libraries worldwide
Finding disjoint trees in planar graphs in linear time(
Book
)
3 editions published in 1992 in English and German and held by 4 WorldCat member libraries worldwide
3 editions published in 1992 in English and German and held by 4 WorldCat member libraries worldwide
Many counterexamples to a conjecture of Las Vergnas and Meyniel by
Bruce A Reed(
Book
)
3 editions published in 1991 in English and German and held by 4 WorldCat member libraries worldwide
3 editions published in 1991 in English and German and held by 4 WorldCat member libraries worldwide
The strongly connected components of 1in, 1out by
Bruce A Reed(
Book
)
3 editions published in 1991 in English and German and held by 4 WorldCat member libraries worldwide
3 editions published in 1991 in English and German and held by 4 WorldCat member libraries worldwide
Almost every graph can be covered by ([Delta]/2) linear forests by
Colin McDiarmid(
Book
)
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
Almost every graph can be covered by [_o63 2] [Omega 2] linear forests by
Colin McDiarmid(
Book
)
2 editions published in 1992 in German and English and held by 2 WorldCat member libraries worldwide
2 editions published in 1992 in German and English and held by 2 WorldCat member libraries worldwide
On a conjecture of Bondy and Fan by
Alan Frieze(
Book
)
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
Covering the edges of a random graph by cliques by
Alan Frieze(
Book
)
1 edition published in 1993 in English and held by 1 WorldCat member library worldwide
1 edition published in 1993 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Sales, Cláudia L. (Cláudia Linhares) Editor
 Molloy, Michael S. Author
 Ramírez Alfonsin, Jorge L. Author Editor
 McDiarmid, Colin Author Editor
 Habib, M. (Michel) Author Editor
 Universität Bonn Sonderforschungsbereich 303 "Information und die Koordination wirtschaftlicher Aktivitäten."
 Frieze, Alan 1945 Author
 Pulleyblank, William R. Author
 McDiarmid, Colin Author
 Karp, Richard M.
Useful Links
Associated Subjects
AlgebraData processing Algorithms Combinatorial analysis Combinatorial optimization Combinatorial packing and covering Computer science Computer software Directed graphs Distribution (Probability theory) Graph coloring Graph theory Information theory Mapcoloring problem Mathematics Paths and cycles (Graph theory) Perfect graphs Probabilities Random graphs Traveling salesman problem
Covers
Alternative Names
Bruce Reed Canadian mathematician
Bruce Reed canadisk informatiker og matematiker
Bruce Reed kanadensisk datavetare och matematiker
Bruce Reed kanadischer Mathematiker und Informatiker
Bruce Reed kanadisk informatikar og matematikar
Bruce Reed kanadisk informatiker og matematiker
Bruce Reed matemático canadiense
Bruce Reed (mathematician) Canadees wiskundige
Reed, Bruce
Reed, Bruce 1962
Reed, Bruce A.
Брюс Рид
Languages