WAOA 2007 Workshop Approximation and Online Algorithms
 |  |
Wall of Fame | Most Viewed WAOA-2007 Paper
WAOA
2007
Springer
13 years 10 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
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 |  | 170 | ||
| 2 | | 158 | ||
| 3 | | 132 | ||
| 4 | | 132 | ||
| 5 | | 126 | ||
| 6 | | 120 | ||
| 7 | | 109 | ||
| 8 | | 109 | ||
| 9 | | 106 | ||
| 10 | | 104 | ||
| 11 | | 103 | ||
| 12 | | 92 | ||
| 13 | | 89 |