170 search results - page 2 / 34 » k-Wise Independent Random Graphs |
RSA
2002
13 years 5 months ago
2002
CORR
2008
Springer
13 years 3 months ago
2008
Springer
WEA
2005
Springer
13 years 10 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
RSA
2011
13 years 8 days ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
JAL
2000
13 years 5 months ago
2000
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...