Revision as of 22:34, 20 October 2009 edit JaGa (talk \| contribs) 97,785 edits m Disambiguate Constant to Constant (mathematics) using popups ← Previous edit		Revision as of 14:06, 28 October 2009 edit undo 77.206.119.52 (talk) No edit summary Next edit →
Line 19: * {{cite book\|author = [[Michael R. Garey]] and [[David S. Johnson]] \| year = 1979 \| title = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]] \| publisher = W.H. Freeman \| isbn = 0-7167-1045-5}} A2.1: ND1, pg.206. *{{cite article\| author=[[Martin Fürer]] and [[Balaji Raghavachari]]\|year=1994\|title=[[ Approximating the Minimum-Degree Steiner Tree to within One of Optimal]]\|journal= Journal of Algorithms }} 17(3):409-423. [[Category:Spanning tree]]

Degree-constrained spanning tree: Difference between revisions