{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:44:47Z","timestamp":1729673087583,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2004.1302951","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"38-47","source":"Crossref","is-referenced-by-count":6,"title":["A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)(extended abstract )"],"prefix":"10.1109","author":[{"given":"D.A.","family":"Bader","sequence":"first","affiliation":[]},{"family":"Guojing Cong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Synthesis of Parallel Algorithms","year":"1993","author":"reif","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90024-9"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","article-title":"Parallel algorithms for the connected components and minimal spanning trees","volume":"14","author":"nash","year":"1982","journal-title":"Information Processing Letters"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/015\/09","article-title":"An empirical assessment of algorithms for constructing a minimal spanning tree","author":"moret","year":"1994","journal-title":"DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science Computational Support for Discrete Mathematics 15"},{"journal-title":"The LEDA Platform of Combinatorial and Geometric Computing","year":"1999","author":"mehlhorn","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840376"},{"key":"ref37","article-title":"Optimal parallel algorithms for integer sorting and graph connectivity","author":"reif","year":"1985","journal-title":"Technical Report TR-08–85"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/72935.72952"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700371065"},{"journal-title":"Graphical Evolution An Introduction to the Theory of Random Graphs","year":"1985","author":"palmer","key":"ref34"},{"key":"ref10","first-page":"378","article-title":"Finding connected components in O(logn log logn) time on the EREW PRAM. J. Algorithms","volume":"18","author":"chong","year":"1995"},{"key":"ref40","first-page":"57","volume":"3","author":"shiloach","year":"1982","journal-title":"An O(logn) parallel connectivity algorithm J Algs"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375847"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/IPPS.1996.508073","article-title":"Parallel implementation of Bor ?vka's minimum spanning tree algorithm","author":"chung","year":"1996","journal-title":"Proc 10th Int'l Parallel Processing Symp (IPPS'96)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90019-X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.1998.740525"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0220066"},{"key":"ref16","first-page":"43","article-title":"Connected components algorithms for mesh-connected parallel computers","author":"goddard","year":"1997","journal-title":"Parallel Algorithms 3rd DIMACS Implementation Challenge October 17–19 1994 volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"ref17","first-page":"16","article-title":"A comparison of data-parallel algorithms for connected components","author":"greiner","year":"1994","journal-title":"Proc 6th Ann Symp Parallel Algorithms and Architectures (SPAA-94)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0078"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/79147.214077"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201022"},{"key":"ref4","article-title":"A new, fast parallel spanning tree algorithm for symmetric multiprocessors (SMPs)","author":"bader","year":"2003","journal-title":"Technical Report 03–001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/140901.141917"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-36265-7_7","article-title":"Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs)","author":"bader","year":"2002","journal-title":"Proc 9th Int'l Conf on High Performance Computing (HiPC 2002)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/35.587723"},{"key":"ref29","first-page":"1","article-title":"Connected components on distributed memory machines","author":"krishnamurthy","year":"1997","journal-title":"Parallel Algorithms 3rd DIMACS Implementation Challenge October 17–19 1994 volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1999.1541"},{"key":"ref8","first-page":"1","article-title":"The Sun Fireplane system interconnect","author":"charlesworth","year":"2001","journal-title":"Proceedings of Supercomputing (SC 2011)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/40.653032"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44688-5_11"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/358628.358650"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676869"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-48518-X_3","article-title":"Designing practical efficient algorithms for symmetric multiprocessors","author":"helman","year":"1999","journal-title":"Algorithm Engineering and Experimentation (ALENEX'99)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359141"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/jpdc.2000.1678","article-title":"Prefix computations on symmetric multiprocessors","volume":"61","author":"helman","year":"2001","journal-title":"J Parallel & Distributed Comput"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1009"},{"key":"ref23","first-page":"23","article-title":"Parallel implementation of algorithms for finding connected components in graphs","author":"hsu","year":"1997","journal-title":"Parallel Algorithms 3rd DIMACS Implementation Challenge October 17–19 1994 volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"ref26","first-page":"688","article-title":"Connected components in O(log3\/2|v|) parallel time for the CREW PRAM","author":"johnson","year":"1991","journal-title":"Proc Annu IEEE Symp Foundations Comput Sci"},{"journal-title":"An Introduction to Parallel Algorithms","year":"1992","author":"j \u00e1j \u00e1","key":"ref25"}],"event":{"name":"18th International Parallel and Distributed Processing Symposium, 2004.","location":"Santa Fe, NM, USA"},"container-title":["18th International Parallel and Distributed Processing Symposium, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9132\/28950\/01302951.pdf?arnumber=1302951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T11:38:44Z","timestamp":1585827524000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1302951\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2004.1302951","relation":{},"subject":[]}}