Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

SODA
2008
ACM

favoriteEmaildiscussreport

133views Algorithms» more SODA 2008»

On the connectivity of dynamic random geometric graphs

13 years 6 months ago

On the connectivity of dynamic random geometric graphs

Download www.lsi.upc.edu

Josep Díaz, Dieter Mitsche, Xavier Pé

Real-time Traffic

Algorithms | SODA 2008 |

claim paper

Related Content

» Distance graphs from random geometric graphs to Bernoulli graphs and between

» Spectral analysis of virus spreading in random geometric networks

» Connected dominating sets on dynamic geometric graphs

» Linear Orderings of Random Geometric Graphs

» A Geometric Preferential Attachment Model of Networks

» Dynamic Random Geometric Graphs

» Efficient Broadcast on Random Geometric Graphs

» Random Geometric Graph Diameter in the Unit Ball

» Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez

Comments (0)