Sciweavers

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

8

SODA
2008
ACM

favoriteEmaildiscussreport

59views Algorithms» more SODA 2008»

Universality of random graphs

13 years 5 months ago

Universality of random graphs

Download www.mathcs.emory.edu

Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vo

Real-time Traffic

Algorithms | SODA 2008 |

claim paper

Related Content

» Almost universal graphs

» Expanders are universal for the class of all spanning trees

» The diameter of random massive graphs

» Nearoptimum Universal Graphs for Graphs with Bounded Degrees

» Reweighted Random Walks for Graph Matching

» A random graph model for massive graphs

» Combinatorial Algorithms

» Hypergraph Matching via Reweighted Random Walks

» Probabilistic flooding for efficient information dissemination in random graph topologies

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski

Comments (0)