Sciweavers

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

13

MFCS
2007
Springer

favoriteEmaildiscussreport

85views Theoretical Computer Science» more MFCS 2007»

Expander Properties and the Cover Time of Random Intersection Graphs

13 years 10 months ago

Expander Properties and the Cover Time of Random Intersection Graphs

Download ru1.cti.gr

Sotiris E. Nikoletseas, Christoforos Raptopoulos,

Real-time Traffic

MFCS 2007 |

claim paper

Related Content

» Noise Tolerance of Expanders and Sublinear Expander Reconstruction

» Tight Bounds for the Cover Time of Multiple Random Walks

» Overlap properties of geometric expanders

» Quasirandom Rumor Spreading Expanders Push vs Pull and Robustness

» Approximation Algorithms for Partial Covering Problems

» Spanders distributed spanning expanders

» Existence and Construction of Edge Disjoint Paths on Expander Graphs

» Random Walk on Directed Dynamic Graphs

» Vertex Cover in Graphs with Locally Few Colors

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	MFCS
Authors	Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis

Comments (0)