Works matching IS 10429832 AND DT 2007 AND VI 31 AND IP 4
Results: 6
The diameter of sparse random graphs.
- Published in:
- Random Structures & Algorithms, 2007, v. 31, n. 4, p. 482, doi. 10.1002/rsa.20197
- By:
- Publication type:
- Article
Improved algorithms for the random cluster graph model.
- Published in:
- Random Structures & Algorithms, 2007, v. 31, n. 4, p. 418, doi. 10.1002/rsa.20181
- By:
- Publication type:
- Article
On learning thresholds of parities and unions of rectangles in random walk models.
- Published in:
- Random Structures & Algorithms, 2007, v. 31, n. 4, p. 406, doi. 10.1002/rsa.20162
- By:
- Publication type:
- Article
Hamiltonicity of random graphs produced by 2-processes.
- Published in:
- Random Structures & Algorithms, 2007, v. 31, n. 4, p. 450, doi. 10.1002/rsa.20133
- By:
- Publication type:
- Article
Nash equilibria in random games.
- Published in:
- Random Structures & Algorithms, 2007, v. 31, n. 4, p. 391, doi. 10.1002/rsa.20199
- By:
- Publication type:
- Article
A probabilistic counting lemma for complete graphs.
- Published in:
- Random Structures & Algorithms, 2007, v. 31, n. 4, p. 517, doi. 10.1002/rsa.20198
- By:
- Publication type:
- Article