Sciweavers

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

22

DC
2006

favoriteEmaildiscussreport

61views Internet Technology» more DC 2006»

Distributed MST for constant diameter graphs

13 years 10 months ago

Distributed MST for constant diameter graphs

Download www.cse.buffalo.edu

Zvi Lotker, Boaz Patt-Shamir, David Peleg

Real-time Traffic

DC 2001 | DC 2006 |

claim paper

Related Content

» Randomtree Diameter and the Diameterconstrained MST

» Distributed Approximation of Capacitated Dominating Sets

» A Very Fast Linear Time Distributed Algorithm on General Graphs for the MinimumWeight Span...

» FISSIONE a scalable constant degree and low congestion DHT scheme based on Kautz graphs

» Computing a DiameterConstrained Minimum Spanning Tree in Parallel

» Why Almost All kColorable Graphs Are Easy to Color

» Compact routing on euclidian metrics

» High Degree Vertices Eigenvalues and Diameter of Random Apollonian Networks

» dBBlue low diameter and selfrouting bluetooth scatternet

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DC
Authors	Zvi Lotker, Boaz Patt-Shamir, David Peleg

Comments (0)