Filter Results:
- Full text PDF available (64)
Publication Year
1936
2018
- This year (1)
- Last 5 years (17)
- Last 10 years (54)
Publication Type
Co-author
Journals and Conferences
Learn More
- Michael Molloy, Bruce A. Reed
- Random Struct. Algorithms
- 1995
Given a sequence of non-negative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n ver-tices of degree i. Essentially, we show that if P i(i?2) i > 0 then… (More)
- Michael Molloy, Bruce A. Reed
- Combinatorics, Probability & Computing
- 1998
Given a sequence of non negative real numbers which sum to we consider a random graph having approximately in ver tices of degree i In the authors essentially show that if P i i i then the graph a s… (More)
- Vasek Chvátal, Bruce A. Reed
- FOCS
- 1992
- Noga Alon, Colin McDiarmid, Bruce A. Reed
- Random Struct. Algorithms
- 1991
Coloring is an abstraction for partitioning a set of objects into a few independent sets. The notion of independence and the associated coloring rules vary from context to context. In the simplest… (More)
- Michael Molloy, Bruce A. Reed
- J. Comb. Theory, Ser. B
- 1997
- Bruce A. Reed, Kaleigh Smith, Adrian Vetta
- Oper. Res. Lett.
- 2004
- Michael Molloy, Bruce A. Reed
- STOC
- 1998
We provide a met.hod to produce an efficient algorithm to find an object whose existence is guaranteed by the Lo&z Local Lemma. We feel that this method will apply to the vast. majority of… (More)
- Colin McDiarmid, Bruce A. Reed
- Networks
- 2000
In cellular telephone networks, sets of radio channels (colors) must be assigned to transmitters (vertices) while avoiding interference. Often, the transmitters are laid out like vertices of a… (More)
- Bruce A. Reed
- STOC
- 1992
We show that for any fixed <italic>k</italic>, there is a linear-time algorithm which given a graph <italic>G</italic> either: (i) finds a cutset <italic>X</italic> of <italic>G</italic> with… (More)