Sciweavers

260 search results - page 4 / 52
» Dynamic Random Geometric Graphs
Sort
View
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 7 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
COMBINATORICA
2011
12 years 9 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
CCCG
2010
13 years 11 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 10 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
ICALP
2005
Springer
14 years 3 months ago
On the Cover Time of Random Geometric Graphs
Chen Avin, Gunes Ercal