Sciweavers

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

23

ICALP
2005
Springer

favoriteEmaildiscussreport

116views Programming Languages» more ICALP 2005»

On the Cover Time of Random Geometric Graphs

14 years 4 months ago

On the Cover Time of Random Geometric Graphs

Download www.bgu.ac.il

Chen Avin, Gunes Ercal

Real-time Traffic

ICALP 2005 | Theoretical Computer Science |

claim paper

Related Content

» The cover time of random geometric graphs

» Improving partial cover of Random Walks in largescale Wireless Sensor Networks

» The cover time of the preferential attachment graph

» Tight Bounds for the Cover Time of Multiple Random Walks

» The cover time of sparse random graphs

» The cover time of the giant component of a random graph

» Expander Properties and the Cover Time of Random Intersection Graphs

» The power of choice in random walks an empirical study

» A Geometric Preferential Attachment Model of Networks

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ICALP
Authors	Chen Avin, Gunes Ercal

Comments (0)