Sciweavers

Share
70 search results - page 1 / 14
» On the connectivity of dynamic random geometric graphs
Sort
View
SODA
2008
ACM
133views Algorithms» more  SODA 2008»
12 years 1 months ago
On the connectivity of dynamic random geometric graphs
Josep Díaz, Dieter Mitsche, Xavier Pé...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
12 years 1 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
12 years 4 months ago
Spectral analysis of virus spreading in random geometric networks
— In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). The spreading of the viral process we consider in this paper is closely rela...
Victor M. Preciado, Ali Jadbabaie
CCCG
2010
12 years 1 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
WG
1999
Springer
12 years 4 months ago
Linear Orderings of Random Geometric Graphs
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
Josep Díaz, Mathew D. Penrose, Jordi Petit,...
books