Sciweavers

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

44

Voted

COMBINATORICA
2002

favoriteEmaildiscussreport

66views more COMBINATORICA 2002»

Random Graph Coverings I: General Theory and Graph Connectivity

14 years 9 months ago

Random Graph Coverings I: General Theory and Graph Connectivity

Download web.fi.uba.ar

Alon Amit, Nathan Linial

Real-time Traffic

COMBINATORICA 2002 |

claim paper

Related Content

» Vertex Cover in Graphs with Locally Few Colors

» Approximating node connectivity problems via set covers

» The Bidimensional Theory of BoundedGenus Graphs

» Maintaining a large matching and a small vertex cover

» Analysis of graphs for digital preservation suitability

» Implementing Huge Sparse Random Graphs

» Bidimensionality and geometric graphs

» Random web crawls

» Tuning message size in opportunistic mobile networks

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICA
Authors	Alon Amit, Nathan Linial

Comments (0)