Sciweavers

Share
ICALP   2001 International Colloquium on Automata
Wall of Fame | Most Viewed ICALP-2001 Paper
ICALP
2001
Springer
9 years 2 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source194
2Download preprint from source177
3Download preprint from source161
4Download preprint from source141
5Download preprint from source119
6Download preprint from source119
7Download preprint from source116
8Download preprint from source115
9Download preprint from source113
10Download preprint from source111
11Download preprint from source107
12Download preprint from source106
13Download preprint from source105
14Download preprint from source104
15Download preprint from source102
16Download preprint from source102
17Download preprint from source100
18Download preprint from source98
19Download preprint from source97
20Download preprint from source94
21Download preprint from source93
22Download preprint from source92
23Download preprint from source90
24Download preprint from source87
25Download preprint from source86
26Download preprint from source85
27Download preprint from source84
28Download preprint from source81
29Download preprint from source70
books