5606 search results - page 33 / 1122 » Randomization Techniques for Graphs. |
COMBINATORICA
2002
13 years 7 months ago
2002
RSA
2000
13 years 7 months ago
2000
RSA
2008
13 years 7 months ago
2008
CPC
2007
13 years 8 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
ISAAC
1998
Springer
14 years 4 days ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...