170 search results - page 1 / 34 » k-Wise Independent Random Graphs |
FOCS
2008
IEEE
13 years 11 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...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
COLOGNETWENTE
2010
13 years 3 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
CPC
2002
13 years 4 months ago
2002