DAFTAR PUSTAKA
Binh H.T.T dan Nguyen T.B. (2008). New particle swarm optimization algorithm for solving degree constrained minimum spanning tree. LNAI, 5351 (2008), 1077-1085.
Dossey, J. (1992). The Nature of Mathematics : Its Role and Its Influence. In D. Grouws, ed., Handbook of Research on Math Teaching and Learning. New York : Macmillan Publishing.
Erickson J. (2011). Algorithms. Departement of Computer Science University of Illinois, Urbana-Champaign.
Garey, M.R., D.S. Johnson. (1979). Computers and Intractability, A Guide to the Theory of NP-Completensess. Freemann, San Francisco.
Krishnamoorthy, M., A.T. Ernst, Y.M. Sharaiha. (2001).Comparison of Algoritms for the Degree Constrained Minimum Spanning Tree. Journal Heuristics, vol. 7.no. 6,pp. 587-611.
Kruskal, J.B. (1956).On the Shortest Tree og a Graph and the Traveling Salesman Problem. Proc. Amer, Math. Soc, vol. 7. pp 48-50.
Ning A, Ma L, dan Xiong X. (2008). A new algorithm for degree constrained minimum spanning tree based on the reduction technique.Progress in Natural Science, 18 (2008), 495-499.
Ribiero C.C dan Souza M.A. (2002). Variable neighbourhood search for the degree constrained minimum spanning tree problem. Descrete applied mathematics, 118; 43-54.
Sri Kusuma Dewi dan Hari Purnomo. (2005). Penyelesaian Masalah Optimasi de-ngan Teknik-teknik Heuristik,Yogyakarta,
Vasudev C. (2006). Graph Theory with Applications. New Delhi: New age inter-national publisher.
