Jump to content

Talk:Minimum degree spanning tree

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Jlwoodwa (talk | contribs) at 06:44, 29 April 2024 (untitled, unsigned). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Untitled

[edit]

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)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Minimum_degree_spanning_tree&oldid=1221321858"