乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T05:18:56Z","timestamp":1733203136460,"version":"3.30.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1006\/jpdc.1999.1518","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T15:41:49Z","timestamp":1034005309000},"page":"181-207","source":"Crossref","is-referenced-by-count":3,"title":["A Parallel Recursive Shortest Spanning Tree Algorithm for Image Segmentation in Distributed Computing Environment"],"prefix":"10.1006","volume":"56","author":[{"given":"S.H","family":"Kwok","sequence":"first","affiliation":[]},{"given":"A.G","family":"Constantinides","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jpdc.1999.1518_RF1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02240073","article-title":"An adaptive and cost-optimal parallel algorithm for minimum spanning tree","volume":"36","author":"Akl","year":"1986","journal-title":"Computing"},{"key":"10.1006\/jpdc.1999.1518_RF2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-8191(89)90005-7","article-title":"Minimal spanning trees: An empirical investigation of parallel algorithms","volume":"12","author":"Barr","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1006\/jpdc.1999.1518_RF3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","article-title":"A parallel algorithm for constructing minimum spanning tree","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"year":"1965","series-title":"Programming, Games, and Transportation Networks","author":"Berge","key":"10.1006\/jpdc.1999.1518_RF4"},{"key":"10.1006\/jpdc.1999.1518_RF5","first-page":"121","article-title":"Segmented-image coding: A performance comparison with discrete cosine transform","volume":"135","author":"Biggar","year":"1988","journal-title":"IEE Proc."},{"key":"10.1006\/jpdc.1999.1518_RF6","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"15","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jpdc.1999.1518_RF7","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1109\/31.1744","article-title":"Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM models","volume":"35","author":"Das","year":"1988","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1006\/jpdc.1999.1518_RF8","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/S0167-8191(05)80155-3","article-title":"Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems","volume":"17","author":"Das","year":"1991","journal-title":"Parallel Comput."},{"key":"10.1006\/jpdc.1999.1518_RF9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1006\/jpdc.1999.1518_RF10","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum-weight spanning trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Programming Lang. Systems"},{"year":"1991","series-title":"Introduction to the Design and Analysis of Algorithms","author":"Goodman","key":"10.1006\/jpdc.1999.1518_RF11"},{"key":"10.1006\/jpdc.1999.1518_RF12","doi-asserted-by":"crossref","unstructured":"A. Kerschenbaum, R. Van Slyke, Computing minimum spanning trees efficiently, Proc. 25th Annu. Conf. of the ACM, 1972, 518, 527","DOI":"10.1145\/800193.569966"},{"key":"10.1006\/jpdc.1999.1518_RF13","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":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1006\/jpdc.1999.1518_RF14","unstructured":"S. H. Kwok, A. G. Constantinides, An optimal parallel algorithm of recursive shortest spanning tree for image segmentation and edge detection, Proceedings of IEEE SICSPCS, 1995, 215, 220"},{"key":"10.1006\/jpdc.1999.1518_RF15","unstructured":"S. H. Kwok, W. C. Siu, A. G. Constantinides, A fast recursive shortest spanning tree for image segmentation, Proceedings, ICNNSP, 1995, 2, 1386, 1389"},{"key":"10.1006\/jpdc.1999.1518_RF16","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/83.551705","article-title":"A fast recursive shortest spanning tree for image segmentation and edge detection","volume":"6","author":"Kwok","year":"1997","journal-title":"IEEE Trans. Image Process."},{"key":"10.1006\/jpdc.1999.1518_RF17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(86)90043-8","article-title":"A fully distributed (minimal) spanning tree algorithm","volume":"23","author":"Lavallee","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1006\/jpdc.1999.1518_RF18","doi-asserted-by":"crossref","unstructured":"Y. N. Lien, A new node-join-tree distributed algorithm for minimum weight spanning trees, 1988 8th International Conference on Distributed Computer Systems, 334, 340","DOI":"10.1109\/DCS.1988.12534"},{"key":"10.1006\/jpdc.1999.1518_RF19","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1049\/ip-f-1.1986.0025","article-title":"Graph theory for image analysis: An approach based on the shortest spanning tree","volume":"133","author":"Morris","year":"1986","journal-title":"IEE Proc. F., Commum. Radar & Signal Process."},{"key":"10.1006\/jpdc.1999.1518_RF20","doi-asserted-by":"crossref","unstructured":"O. J. Morris, M. de J. Lee, A. G. Constantinides, A unified method for segmentation and detection using graph theory, Proc. ICASSP, 1986, 2051, 2054","DOI":"10.1109\/ICASSP.1986.1168866"},{"key":"10.1006\/jpdc.1999.1518_RF21","article-title":"Progressive image coding from a spanning tree image representation","author":"Morris","year":"1987","journal-title":"Onzieme Colloq."},{"key":"10.1006\/jpdc.1999.1518_RF22","unstructured":"O. J. Morris, A. G. Constantinides, Thin link coding techniques, International Conference on Digital Signal Processing, Florence, Italy, 1987"},{"key":"10.1006\/jpdc.1999.1518_RF23","unstructured":"O. J. Morris, A. G. Constantinides, Segmented video coding, Proc. ICASSP, 1988, 1\u20135, 1108, 1111"},{"key":"10.1006\/jpdc.1999.1518_RF24","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Tech. J."},{"key":"10.1006\/jpdc.1999.1518_RF25","doi-asserted-by":"crossref","unstructured":"T. Przytycka, L. Higham, Optimal cost-sensitive distributed minimum spanning tree algorithm, Algorithm Theory\u2014SWAT '96. 5th Scandinavian Workshop on Algorithm Theory, Proceedings, 1996, 246, 258","DOI":"10.1007\/3-540-61422-2_136"},{"key":"10.1006\/jpdc.1999.1518_RF26","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","article-title":"Parallel graph algorithms","volume":"16","author":"Quinn","year":"1984","journal-title":"Comput. Surv."},{"key":"10.1006\/jpdc.1999.1518_RF27","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-3615(89)90048-1","article-title":"A fast algorithm for the minimum spanning tree","volume":"13","author":"Suraweera","year":"1989","journal-title":"Comput. Indus."},{"key":"10.1006\/jpdc.1999.1518_RF28","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(93)90019-6","article-title":"AnOm","volume":"45","author":"Suraweera","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1006\/jpdc.1999.1518_RF29","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","article-title":"AOEV","volume":"4","author":"Yao","year":"1975","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731599915186?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731599915186?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T23:18:56Z","timestamp":1733181536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731599915186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0743731599915186"],"URL":"https:\/\/doi.org\/10.1006\/jpdc.1999.1518","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}