{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:32Z","timestamp":1738387832950,"version":"3.35.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1007\/bf02948795","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T23:54:57Z","timestamp":1221263697000},"page":"116-125","source":"Crossref","is-referenced-by-count":0,"title":["Efficient minimum spanning tree algorithms on the reconfigurable mesh"],"prefix":"10.1007","volume":"15","author":[{"given":"Yingyu","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Kruskal J B. On the shortest subtree of a graph and the travelling salesman problem. InProc. Amer. Math. Soc., 1956, 7(1): 48\u201350.","key":"BF02948795_CR1","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"issue":"6","key":"BF02948795_CR2","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R C Prim","year":"1957","unstructured":"Prim R C. Shortest connection networks and some generalizations.Bell System Tech. J., 1957, 36(6): 1389\u20131401.","journal-title":"Bell System Tech. J."},{"unstructured":"Sollin M. An Algorithm Attributed to Sollin. InIntroduction to the Design and Analysis of Algorithms, Goodman S E, Hedetniemi S T (eds.), McGraw-Hill, 1977.","key":"BF02948795_CR3"},{"issue":"3","key":"BF02948795_CR4","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0213036","volume":"13","author":"Y H Tsin","year":"1984","unstructured":"Tsin Y H, Chin F Y. Efficient parallel algorithms for a class of graph theoretic problems.SIAM J. Comput., 1984, 13(3): 580\u2013590.","journal-title":"SIAM J. Comput."},{"unstructured":"Kwan S C, Ruzzo W L. Adaptive Parallel Algorithms for Finding Minimum Spanning Trees. InProc. Int. Conf. Parallel Processing, 1984, pp.439\u2013443.","key":"BF02948795_CR5"},{"issue":"1","key":"BF02948795_CR6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","volume":"14","author":"D Nath","year":"1982","unstructured":"Nath D, Maheswari S N. Parallel algorithms for the connected components and minimal tree problems.Inform. Proc. Lett., 1982, 14(1): 7\u201311.","journal-title":"Inform. Proc. Lett."},{"doi-asserted-by":"crossref","unstructured":"Huang M D. Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Network. InProc. 26th Annu. IEEE Symp. FOCS, 1985, pp.232\u2013240.","key":"BF02948795_CR7","DOI":"10.1109\/SFCS.1985.52"},{"key":"BF02948795_CR8","first-page":"291","volume":"126","author":"B M Maggs","year":"1987","unstructured":"Maggs B M, Plotkin S A. Minimum-cost spanning trees as a path-finding problem.Inform. Proc. Lett., 1987\/1988, 126: 291\u2013293.","journal-title":"Inform. Proc. Lett."},{"issue":"6","key":"BF02948795_CR9","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/12.277290","volume":"42","author":"R Miller","year":"1993","unstructured":"Miller R, Prasanna Kumar V K, Resis D, Stout Q F. Parallel computation on reconfigurable meshes.IEEE Trans. Computer, 1993, 42(6): 678\u2013692.","journal-title":"IEEE Trans. Computer"},{"issue":"4","key":"BF02948795_CR10","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/71.80177","volume":"1","author":"B F Wang","year":"1990","unstructured":"Wang B F, Chen G H. Constant time algorithms for the transitive closure problem and some related graph problems with reconfigurable bus systems.IEEE Trans. Parallel and Distributed Systems, 1990, 1(4): 500\u2013507.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"doi-asserted-by":"crossref","unstructured":"Miller R, Prasanna Kumar V K, Resis D, Stout Q F. Meshes with Reconfigurable Buses. InProc. MIT Conf. Advanced Research in VLSI, Apr. 1988, pp.163\u2013178.","key":"BF02948795_CR11","DOI":"10.7551\/mitpress\/1102.003.0014"},{"issue":"1","key":"BF02948795_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/MC.1982.1653826","volume":"15","author":"L Snyder","year":"1982","unstructured":"Snyder L. Introduction to the configurable highly parallel computer.Computer, 1982, 15(1): 47\u201356.","journal-title":"Computer"},{"key":"BF02948795_CR13","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0743-7315(87)90003-7","volume":"4","author":"V K Prasanna Kumar","year":"1987","unstructured":"Prasanna Kumar V K, Raghavendra C S. Array processor with multiple broadcasting.J. Parallel and Distributed Computing, 1987, 4: 173\u2013190.","journal-title":"J. Parallel and Distributed Computing"},{"issue":"4","key":"BF02948795_CR14","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/21.17370","volume":"18","author":"J Rothstein","year":"1988","unstructured":"Rothstein J. Bus Automata, Brains, and Mental Models.IEEE Trans. System, Man, and Cybernetics, 1988, 18(4): 522\u2013531.","journal-title":"IEEE Trans. System, Man, and Cybernetics"},{"issue":"9","key":"BF02948795_CR15","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/12.29479","volume":"38","author":"H Li","year":"1989","unstructured":"Li H, Maresca M. Polymorphic-torus network.IEEE Trans. Computer, 1989, 38(9): 1345\u20131351.","journal-title":"IEEE Trans. Computer"},{"unstructured":"Weems C C, Burrill J H. The Image Understanding Architecture and Its Programming Environment. InParallel Architectures and Algorithms for Image Understanding, Prasanna Kumar V K (ed.), Academic Press, 1991.","key":"BF02948795_CR16"},{"doi-asserted-by":"crossref","unstructured":"Kao T W, Horng S J. Computing Connected Components and Some Related Applications on RAP. InProc. ICPP, 1993, III-57\u2013III-64.","key":"BF02948795_CR17","DOI":"10.1109\/ICPP.1993.63"},{"unstructured":"Jenq J, Sahni S. Reconfigurable Mesh Algorithms for the Area and Primeter of Image Components. InProc. Int. Conf. Parallel Processing, Pennsylvania State Univ. Press, 1991, pp.280\u2013281.","key":"BF02948795_CR18"},{"doi-asserted-by":"crossref","unstructured":"Miller R, Prasanna Kumar V K, Resis D, Stout Q F. Image Computations on Reconfigurable Mesh. InProc. IEEE Conf. Computer vision and Pattern Recognition, 1988, pp.925\u2013930.","key":"BF02948795_CR19","DOI":"10.1109\/CVPR.1988.196343"},{"doi-asserted-by":"crossref","unstructured":"Resis D. An Efficient Convex Hull Computation on the Reconfigurable Mesh. InProc. Int. Parallel Processing Symp. \u201992, 1992, pp.142\u2013145.","key":"BF02948795_CR20","DOI":"10.1109\/IPPS.1992.223057"},{"issue":"1","key":"BF02948795_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/71.569648","volume":"8","author":"J W Jang","year":"1997","unstructured":"Jang J W, Nigam M, Prasanna V K, Sahni S. Constant time algorithms for computational geometry on the reconfigurable mesh.IEEE Trans. Parallel and Distributed Systems, 1997, 8(1): 1\u201312.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"2","key":"BF02948795_CR22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0743-7315(91)90084-M","volume":"13","author":"Y Ben-Asher","year":"1991","unstructured":"Ben-Asher Y, Peleg D, Ramaswami R, Schuster A. The power of reconfiguration.J. Parallel and Distributed Computing, 1991, 13(2): 139\u2013153.","journal-title":"J. Parallel and Distributed Computing"},{"unstructured":"Wang B F, Chen G H, Li H. Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems. InProc. Int. Parallel Processing Symp., 1991.","key":"BF02948795_CR23"},{"issue":"5","key":"BF02948795_CR24","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/71.598278","volume":"8","author":"J W Jang","year":"1997","unstructured":"Jang J W, Park H, Prasanna V K. An optimalmultiplication algorithm on reconfigurable mesh.IEEE Trans. Parallel and Distributed Systems, 1997, 8(5): 521\u2013532.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"doi-asserted-by":"crossref","unstructured":"Jang J W, Prasanna V K. An Optimal Sorting Algorithm on Reconfigurable Mesh. InProc. Int. Parallel Processing Symp., Mar. 1992, pp.130\u2013137.","key":"BF02948795_CR25","DOI":"10.1109\/IPPS.1992.223059"},{"doi-asserted-by":"crossref","unstructured":"Lin R, Olariu S, Schwing J, Zhang J. Sorting inO(1) Time on ann\u00d7n Reconfigurable Mesh. InProc. European Workshop on Parallel Computing, 1992, pp.16\u201327.","key":"BF02948795_CR26","DOI":"10.1109\/PCCC.1992.200594"},{"unstructured":"Nigam M, Sahni S. Sortingn Numbers onn\u00d7n Reconfiguable Meshes with Buses. Technical Report TR-92-04, Univ. of Florida, 1992.","key":"BF02948795_CR27"},{"key":"BF02948795_CR28","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0020-0190(90)90158-T","volume":"34","author":"B F Wang","year":"1990","unstructured":"Wang B F, Chen G H, Lin F C. Constant Time Sorting on a Processor Array with a Reconfigurable Bus System.Inform. Proc. Lett., 1990, 34: 187\u2013192.","journal-title":"Inform. Proc. Lett."},{"unstructured":"Joseph J\u00e0J\u00e0. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.","key":"BF02948795_CR29"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948795.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02948795\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:48:53Z","timestamp":1738363733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02948795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["BF02948795"],"URL":"https:\/\/doi.org\/10.1007\/bf02948795","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}