CIAC 2000 Italian Conference on Algorithms and Complexity
 |  |
Wall of Fame | Most Viewed CIAC-2000 Paper
CIAC
2000
Springer
13 years 8 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
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 |  | 210 | ||
| 2 | | 121 | ||
| 3 | | 118 | ||
| 4 | | 105 | ||
| 5 | | 104 | ||
| 6 | | 83 | ||
| 7 | | 82 |