Search Sciweavers | Sciweavers

142 search results - page 1 / 29

» The Diameter of Sparse Random Graphs

click to vote

CPC
2010

103views more CPC 2010»

The Diameter of Sparse Random Graphs

14 years 9 months ago

Download math.ucsd.edu

Oliver Riordan, Nicholas C. Wormald

claim paper

Read More »

click to vote

APPROX
2004
Springer

135views Algorithms» more APPROX 2004»

The Diameter of Randomly Perturbed Digraphs and Some Applications.

15 years 5 months ago

Download www.math.cmu.edu

The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...

Abraham Flaxman, Alan M. Frieze

claim paper

Read More »

113

click to vote

SODA
2001
ACM

138views Algorithms» more SODA 2001»

The diameter of random massive graphs

15 years 1 months ago

Download www.math.sc.edu

Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...

Linyuan Lu

claim paper

Read More »

click to vote

ICALP
2004
Springer

112views Programming Languages» more ICALP 2004»

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs

15 years 5 months ago