Sciweavers

Share
70 search results - page 2 / 14
» On the connectivity of dynamic random geometric graphs
Sort
View
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
12 years 7 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
CORR
2007
Springer
85views Education» more  CORR 2007»
12 years 1 months ago
Dynamic Random Geometric Graphs
Josep Díaz-Giménez, Dieter Mitsche, ...
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
12 years 11 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...
ALGORITHMICA
2007
117views more  ALGORITHMICA 2007»
12 years 2 months ago
Random Geometric Graph Diameter in the Unit Ball
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
Robert B. Ellis, Jeremy L. Martin, Catherine H. Ya...
IM
2008
12 years 1 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
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...
Chen Avin
books