#### Filter Results:

- Full text PDF available (57)

#### Publication Year

1994

2017

- This year (2)
- Last 5 years (14)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

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 such graphs almost surely have a giant component, while if P i(i?2) i < 0 then almost surely all components in such graphs are small. We can apply these results… (More)

- Michael Molloy, Bruce A. Reed
- Combinatorics, Probability & Computing
- 1998

Given a sequence of non-negative real numbers 0 ; 1 ; : : : which sum to 1, we consider a random graph having approximately i n ver-tices of degree i. In 12] the authors essentially show that if P i(i ? 2) i > 0 then the graph a.s. has a giant component, while if P i(i ? 2) i < 0 then a.s. all components in the graph are small. In this paper we analyze the… (More)

- 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 applications of the Local Lemma, unless t,he application has one of four problematic traits. However, proving that the method applies to a particular application may… (More)

In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intriguingly, experimental results with various models for generating random CSP instances suggest that the probability of such problems having a solution exhibits a “threshold–like”… (More)

- Michael Molloy, Bruce A. Reed
- J. Comb. Theory, Ser. B
- 1997

- Michael Molloy
- Random Struct. Algorithms
- 2005

- Russell Greiner, Ryan B. Hayward, Magdalena Jankowska, Michael Molloy
- Artif. Intell.
- 2006

Many tasks require evaluating a specified Boolean expression over a set of probabilistic tests whose costs and success probabilities are each known. A strategy specifies when to perform which test, towards determining the overall outcome of . We are interested in finding the strategy with the minimum expected cost. As this task is typically NP-hard — for… (More)

- Michael Molloy, Mohammad R. Salavatipour
- J. Comb. Theory, Ser. B
- 2005

Wegner conjectured that the chromatic number of the square of any planar graph G with maximum degree 8 is bounded by (G2) 3 2 + 1. We prove the bound (G2) 3 + 78. This is asymptotically an improvement on the previously best-known bound. For large values of we give the bound of (G2) 3 + 25. We generalize this result to L(p, q)-labeling of planar graphs, by… (More)

- Michael Molloy
- SIAM J. Comput.
- 2004

- Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
- J. Algorithms
- 1996

∗Department of Mathematics, Carnegie Mellon University. Supported in part by NSF grants CCR9024935 and CCR9225008. †Department of Computer Science, University of Edinburgh, The King’s Buildings, Edinburgh EH9 3JZ, Uunited Kingdom. Supported in part by grant GR/F 90363 of the UK Science and Engineering Research Council, and Esprit Working Group 7097 “RAND.”… (More)