851 search results - page 40 / 171 » Random constructions and density results |
RSA
2011
13 years 3 months 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...
IM
2008
13 years 8 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
PODC
2012
ACM
11 years 11 months ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
MWCN
2004
Springer
14 years 1 months ago
2004
Springer
Inter-vehicle communication is becoming increasingly important in recent years. Traditional research efforts on vehicular networks have been put into safety or infotainment applica...