{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:34:34Z","timestamp":1725600874815},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232138"},{"type":"electronic","value":"9783642232145"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23214-5_56","type":"book-chapter","created":{"date-parts":[[2011,8,16]],"date-time":"2011-08-16T08:55:52Z","timestamp":1313484952000},"page":"424-431","source":"Crossref","is-referenced-by-count":0,"title":["Realization of the Minimum Cost Spanning Tree\u2019s Storage and Optimization in Prim Algorithm"],"prefix":"10.1007","author":[{"given":"Pan","family":"Da-zhi","sequence":"first","affiliation":[]},{"given":"Liu","family":"Zhi-bin","sequence":"additional","affiliation":[]},{"given":"Chen","family":"You-jun","sequence":"additional","affiliation":[]},{"given":"Ding","family":"Xian-feng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"56_CR1","volume-title":"Data Structure","author":"W.M. Yan","year":"2001","unstructured":"Yan, W.M., Wu, W.M.: Data Structure. Tsinghua University Press, Beijing (2001)"},{"issue":"2","key":"56_CR2","first-page":"134","volume":"28","author":"Q. Sun","year":"2002","unstructured":"Sun, Q., Sheng, J.H., Gu, Z.J.: Algorithm for Finding All the Shortest Paths from One Node to Another in A Graph. Computer Engineering\u00a028(2), 134\u2013136 (2002)","journal-title":"Computer Engineering"},{"issue":"2","key":"56_CR3","first-page":"93","volume":"27","author":"L.P. Hou","year":"2003","unstructured":"Hou, L.P., Li, W.S.: Minimum Spanning Tree Algorithm Based on Extended Double List Storage Structure. Journal of Beijing Jiaotong University\u00a027(2), 93\u201395 (2003)","journal-title":"Journal of Beijing Jiaotong University"},{"issue":"9","key":"56_CR4","first-page":"34","volume":"14","author":"K.X. Wan","year":"1991","unstructured":"Wan, K.X., Enslow, H., Pan, Q.J.: the New Algorithm of CMST Problem. Chinese Journal of Computers\u00a014(9), 34\u201337 (1991)","journal-title":"Chinese Journal of Computers"},{"issue":"8","key":"56_CR5","first-page":"162","volume":"25","author":"W.G. Lai","year":"2008","unstructured":"Lai, W.G., Li, O., Cheng, J.: A Novel Genetic Algorithm for Degree Constrained Minimum Spanning Tree Problem. Computer Simulation\u00a025(8), 162\u2013165 (2008)","journal-title":"Computer Simulation"},{"issue":"12","key":"56_CR6","first-page":"69","volume":"43","author":"H.B. Li","year":"2007","unstructured":"Li, H.B., Chen, J.: Dynamic optimum of minimum span tree\u2019s algorithm devised by Prim. Computer Engineering and Applications\u00a043(12), 69\u201373 (2007)","journal-title":"Computer Engineering and Applications"}],"container-title":["Communications in Computer and Information Science","Applied Informatics and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23214-5_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T15:10:13Z","timestamp":1554045013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23214-5_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232138","9783642232145"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23214-5_56","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}