FSTTCS   2001 Foundations of Software Technology and Theoretical Computer Science
Wall of Fame | Most Viewed FSTTCS-2001 Paper
11 years 9 months ago
The Directed Minimum-Degree Spanning Tree Problem
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...
Radha Krishnan, Balaji Raghavachari
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.
1Download preprint from source203
2Download preprint from source168
3Download preprint from source145
4Download preprint from source135
5Download preprint from source129
6Download preprint from source129
7Download preprint from source113
8Download preprint from source109
9Download preprint from source102
10Download preprint from source102
11Download preprint from source96
12Download preprint from source92
13Download preprint from source75