SWAT 1990 Scandinavian Workshop on Algorithm Theory
 |  |
Wall of Fame | Most Viewed SWAT-1990 Paper
SWAT
1990
Springer
13 years 9 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
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 |  | 75 | ||
| 2 | | 72 | ||
| 3 | | 66 |