{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:17Z","timestamp":1759335617026},"reference-count":10,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10267,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given a connected graph with edge costs, we seek a spanning tree having a specified degree at one vertex r, with cost as small as possible. A previous algorithm, using edge exchanges, has run time 0(V<jats:sup>2<\/jats:sup>); we improve this to 0(E log log V+V log V). Here V and E are the number of vertices and edges. The algorithm uses edge exchanges ordered efficiently on a reduced graph; it also uses efficient algorithms for minimum spanning trees and priority queues.<\/jats:p>","DOI":"10.1002\/net.3230080304","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T08:49:49Z","timestamp":1178873389000},"page":"201-208","source":"Crossref","is-referenced-by-count":36,"title":["A good algorithm for smallest spanning trees with a degree constraint"],"prefix":"10.1002","volume":"8","author":[{"given":"H. N.","family":"Gabow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A.","year":"1974"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0205051"},{"key":"e_1_2_1_4_2","unstructured":"Gabow H. N. \u201cHu's Optimum Communication Spanning Tree Problem is NP\u2010Complete \u201d unpublished memo."},{"key":"e_1_2_1_5_2","unstructured":"Glover F.andD.Klingman \u201cFinding Minimum Spanning Trees with a Fixed Number of Links at a Node \u201d Report No. 74\u20105 Research Report CS #169 Center for Cybernetic Studies University of Texas at Austin Austin Texas 1974."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0203015"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem","volume":"1","author":"Kruskal J. B.","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080306"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/0204032"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070103"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90056-3"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:43:04Z","timestamp":1699778584000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,9]]}},"alternative-id":["10.1002\/net.3230080304"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080304","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,9]]}}}