2310 search results - page 97 / 462 » Coloring Random Graphs |
MFCS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
RSA
2011
13 years 5 months ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
IMAGING
2003
13 years 11 months ago
2003
Color images acquired through single chip digital cameras using a color filter array (CFA) contain a mixture of luminance and opponent chromatic information that share their repre...