FSTTCS 2001 Foundations of Software Technology and Theoretical Computer Science
 |  |
Wall of Fame | Most Viewed FSTTCS-2001 Paper
FSTTCS
2001
Springer
13 years 10 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
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 |  | 203 | ||
| 2 | | 168 | ||
| 3 | | 145 | ||
| 4 | | 135 | ||
| 5 | | 129 | ||
| 6 | | 129 | ||
| 7 | | 113 | ||
| 8 | | 109 | ||
| 9 | | 102 | ||
| 10 | | 102 | ||
| 11 | | 96 | ||
| 12 | | 92 | ||
| 13 | | 75 |