Sciweavers

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

86

Voted

JEA
2008

64views more JEA 2008»

Fast computation of empirically tight bounds for the diameter of massive graphs

15 years 2 months ago

Fast computation of empirically tight bounds for the diameter of massive graphs

Download www-rp.lip6.fr

Clémence Magnien, Matthieu Latapy, Michel H

Real-time Traffic

JEA 2008 |

claim paper

Related Content

» Computing a DiameterConstrained Minimum Spanning Tree in Parallel

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JEA
Authors	Clémence Magnien, Matthieu Latapy, Michel Habib

Comments (0)