Michael Molloy
Michael Molloy
Affiliazione sconosciuta
Email verificata su cs.toronto.edu - Home page
TitoloCitata daAnno
A critical point for random graphs with a given degree sequence
M Molloy, B Reed
Random Structures & Algorithms 6 (2‐3), 161-180, 1995
23101995
The size of the giant component of a random graph with a given degree sequence
M Molloy, B Reed
Combinatorics probability and computing 7 (3), 295-305, 1998
8651998
Graph colouring and the probabilistic method
MS Molloy, BA Reed
Springer Verlag, 2002
501*2002
Graph colouring via the probabilistic method
M Molloy, B Reed
Graph Theory and Computational Biology, A. Gyrafas and L. Lovasz editors, J …, 1999
501*1999
Further algorithmic aspects of the local lemma
M Molloy, B Reed
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
2361998
Random constraint satisfaction: A more accurate picture
D Achlioptas, L Kirousis, E Kranakis, D Krizanc, M Molloy, Y Stamatiou
Principles and Practice of Constraint Programming-CP97, 107-120, 1997
203*1997
A bound on the chromatic number of the square of a planar graph
M Molloy, MR Salavatipour
Journal of Combinatorial Theory, Series B 94 (2), 189-213, 2005
1822005
A bound on the strong chromatic index of a graph
M Molloy, B Reed
Journal of Combinatorial Theory, Series B 69 (2), 103-109, 1997
1491997
Random constraint satisfaction: a more accurate picture
D Achlioptas, LM Kirousis, E Kranakis, D Krizanc, MSO Molloy, ...
Random structures and algorithms 12, 253-269, 1998
1421998
Random constraint satisfaction: A more accurate picture
D Achlioptas, L Kirousis, E Kranakis, D Krizanc, M Molloy, Y Stamatiou
Principles and Practice of Constraint Programming-CP97, 107-120, 1997
1421997
Cores in random hypergraphs and Boolean formulas
M Molloy
Random Structures & Algorithms 27 (1), 124-135, 2005
1252005
A bound on the total chromatic number
M Molloy, B Reed
Combinatorica 18 (2), 241-280, 1998
1071998
The analysis of a list-coloring algorithm on a random graph
D Achlioptas, M Molloy
Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium …, 1997
901997
Frequency channel assignment on planar networks
M Molloy, M Salavatipour
Algorithms—ESA 2002, 736-747, 2002
802002
A sharp threshold in proof complexity
D Achlioptas, P Beame, M Molloy
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
762001
A sharp threshold in proof complexity
M Molloy
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing …, 2001
76*2001
Colouring a graph frugally
H Hind, M Molloy, B Reed
Combinatorica 17 (4), 469-482, 1997
731997
Models for random constraint satisfaction problems
M Molloy
SIAM Journal on Computing 32 (4), 935-949, 2003
722003
Models and thresholds for random constraint satisfaction problems
M Molloy
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
72*2002
Generating and counting Hamilton cycles in random regular graphs
A Frieze, M Jerrum, M Molloy, RW Robinson
Elsevier, 1996
691996
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20