Revision as of 21:31, 18 March 2016 edit BG19bot (talk \| contribs) 1,005,055 edits m Remove blank line(s) between list items per WP:LISTGAP to fix an accessibility issue for users of screen readers. Do WP:GENFIXES and cleanup if needed. Discuss this at Wikipedia talk:WikiProject Accessibility#LISTGAP ← Previous edit		Revision as of 04:21, 22 February 2019 edit undo Citation bot (talk \| contribs) Bots 5,867,163 edits m Alter: title, isbn. Add: citeseerx, title-link. \| You can use this bot yourself. Report bugs here. \| User-activated. Next edit →
Line 23: ==References== {{Reflist}} * {{citation\|author1-link = Michael R. Garey\|first1=Michael R.\|last1=Garey\|author2-link=David S. Johnson\|first2=David S.\|last2=Johnson \| year = 1979 \| title = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]] \| publisher = W.H. Freeman \| isbn = 978-0-7167-1045-5\|postscript=. A2.1: ND1, p. 206.\|title-link=Computers and Intractability: A Guide to the Theory of NP-Completeness}} *{{citation\|first1=Martin\|last1=Fürer\|first2=Balaji\|last2=Raghavachari\|year=1994\|title=Approximating the minimum-degree Steiner tree to within one of optimal\|journal=Journal of Algorithms\|volume=17\|issue=3\|pages=409–423\|doi=10.1006/jagm.1994.1042\|postscript=.\|citeseerx=10.1.1.136.1089}} [[Category:Spanning tree]]

Degree-constrained spanning tree: Difference between revisions