Talk:Minimum degree spanning tree
Jump to navigation
Jump to search
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Untitled
The minimum degree spanning tree (MDST) is a spanning tree with the vertices of the smallest possible degrees. — Preceding unsigned comment added by 92.80.124.34 (talk) 08:50, 12 April 2009 (UTC)