2310 search results - page 114 / 462 » Coloring Random Graphs |
112
click to vote
CCCG
2009
15 years 3 months ago
2009
We study the emergence of rigid components in an Erdos-R
110
click to vote
RSA
2006
15 years 2 months ago
2006
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
109
click to vote
ARSCOM
1998
15 years 2 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
141
click to vote
IMCSIT
2010
15 years 9 days ago
2010
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
118
Voted
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...