SODA 1994 Symposium on Discrete Algorithms
 |  |
Wall of Fame | Most Viewed SODA-1994 Paper
SODA
1994
ACM
14 years 22 days ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 138 | ||
| 2 | | 133 | ||
| 3 | | 105 | ||
| 4 | | 103 | ||
| 5 | | 100 | ||
| 6 | | 97 | ||
| 7 | | 93 | ||
| 8 | | 89 | ||
| 9 | | 88 | ||
| 10 | | 85 | ||
| 11 | | 81 | ||
| 12 | | 81 | ||
| 13 | | 81 | ||
| 14 | | 75 | ||
| 15 | | 73 | ||
| 16 | | 72 | ||
| 17 | | 71 | ||
| 18 | | 67 | ||
| 19 | | 63 | ||
| 20 | | 61 |