{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:49:44Z","timestamp":1729630184471,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icppw.2002.1039757","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T23:34:26Z","timestamp":1056584066000},"page":"398-404","source":"Crossref","is-referenced-by-count":1,"title":["Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique"],"prefix":"10.1109","author":[{"family":"Li-Jen Mao","sequence":"first","affiliation":[]},{"family":"Sheau-Dong Lang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Parallel Computation of Constrained Spanning Trees Heuristics and SIMD Implementations","year":"1997","author":"kumar","key":"ref10"},{"key":"ref11","first-page":"15","article-title":"A Comparison of Two Parallel Approximate Algorithms for the Degree-Constrained Minimum Spanning Tree Problem","volume":"123","author":"mao","year":"1997","journal-title":"Congressus Numerantium"},{"key":"ref12","first-page":"184","article-title":"A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using the Nearest Neighbor Chains","author":"mao","year":"1999","journal-title":"Proceedings of the 1999 International Symposium on Parallel Architectures Algorithms and Networks"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/015\/09","article-title":"An empirical assessment of algorithms for constructing a minimum spanning tree","volume":"15","author":"moret","year":"0","journal-title":"Computational Support for Discrete Mathematics DIMACS Workshop"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(80)90022-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90029-4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167209"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(85)90032-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(83)90161-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90169-0"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref4"},{"key":"ref3","first-page":"879","article-title":"The shortest generalized Hamiltonian tree","author":"deo","year":"1968","journal-title":"Proc 6th Annual Allerton Conference"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","article-title":"Topological design of centralized computer networks - Formulation and algorithms","volume":"12","author":"gavish","year":"1982","journal-title":"Networks"},{"key":"ref8","first-page":"412","article-title":"Low degree spanning tree of small weights","author":"khuller","year":"1994","journal-title":"Proc of 26th Annual ACM STOCS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584070"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(95)00010-0"},{"journal-title":"The Design and Analysis of Computer Algorithm","year":"1974","author":"aho","key":"ref1"},{"key":"ref9","first-page":"83","article-title":"Comparison of heuristic algorithms for the degree constrained minimum spanning tree","author":"krishnamoorthy","year":"1996","journal-title":"Metaheuristics Theory and Applications"},{"journal-title":"Data Structures and Algorithm Analysis in C","year":"1997","author":"weiss","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01609023"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90056-3"}],"event":{"name":"International Conference on Parallel Processing Workshop","acronym":"ICPPW-02","location":"Vancouver, BC, Canada"},"container-title":["Proceedings. International Conference on Parallel Processing Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8062\/22290\/01039757.pdf?arnumber=1039757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T23:52:09Z","timestamp":1519516329000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1039757\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icppw.2002.1039757","relation":{},"subject":[]}}