Sciweavers

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

13

DC
2010

favoriteEmaildiscussreport

124views Internet Technology» more DC 2010»

Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

13 years 4 months ago

Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

Download www.cs.bgu.ac.il

Leonid Barenboim, Michael Elkin

Real-time Traffic

DC 2001 | DC 2010 |

claim paper

Related Content

» A new technique for distributed symmetry breaking

» Colored intersection searching via sparse rectangular matrix multiplication

» Colibri fast mining of large static and dynamic graphs

» On spacestretch tradeoffs upper bounds

» Hierarchical Eigensolver for Transition Matrices in Spectral Methods

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DC
Authors	Leonid Barenboim, Michael Elkin

Comments (0)