Revision as of 02:13, 19 October 2010 edit Wladston (talk \| contribs) 43 edits m →Degree Constrained minimun spanning tree ← Previous edit		Revision as of 02:44, 19 October 2010 edit undo Wladston (talk \| contribs) 43 edits →Degree-constrained minimun spanning tree: fixing link Next edit →
Line 12: ==Degree-constrained minimun spanning tree== On a weighted graph, a Degree-constrained minimun spanning tree (DCMST) is a degree-constrained spanning tree in with the sum of its vertices has the minimun possible sum. Finding a DCMST is an NP-Hard problem.<ref>Bui, T. N. and Zrncic, C. M. 2006. [http://www.cs.~~unm~~york.~~edu~~ac.uk/rts/docs/~~~tnguyen~~GECCO_2006/~~Papers~~docs/mcp11.pdf An ant-based algorithm for finding degree-constrained minimum spanning tree.] In GECCO ’06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 11–18, New York, NY, USA. ACM.</ref>

Degree-constrained spanning tree: Difference between revisions