{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:47:42Z","timestamp":1729666062485,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2004.1302953","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"39-48","source":"Crossref","is-referenced-by-count":21,"title":["Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (extended abstract )"],"prefix":"10.1109","author":[{"given":"D.A.","family":"Bader","sequence":"first","affiliation":[]},{"family":"Guojing Cong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","article-title":"Routing using implicit connection graphs","author":"zheng","year":"1996","journal-title":"9th Int'l Conf on VLSI Design VLSI in Mobile Communication"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/3-540-63890-3_24"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1137\/S0097539700371065"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1109\/IPDPS.2002.1015509","article-title":"Optimizing graph algorithms for improved cache performance","author":"park","year":"2002","journal-title":"Proc Int'l Parallel and Distributed Processing Symp (IPDPS 2002)"},{"key":"ref30","first-page":"327","article-title":"Identification of regulatory binding sites using minimum spanning trees","author":"olman","year":"2003","journal-title":"Proc 8th Pacific Symp Biocomputing (PSB 2003)"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1016\/0020-0190(85)90025-0"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/4434.736426"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1137\/0214061"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1016\/S0020-0190(98)00127-6"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/237502.237563"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/RELDIS.1998.740525"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1021\/jm00081a021"},{"key":"ref13","first-page":"72","article-title":"Can shared-memory model serve as a bridging model for parallel computation?","author":"gibbons","year":"1997","journal-title":"Proc 9th Ann ACM Symp on Parallel Algorithms and Architectures (SPAA)"},{"key":"ref14","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":"ref15","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":"ref16","first-page":"37","article-title":"Designing practical efficient algorithms for symmetric multiprocessors","author":"helman","year":"1999","journal-title":"Algorithm Engineering and Experimentation (ALENEX'99) Volume 1619 of Lecture Notes in Computer Science"},{"key":"ref17","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"},{"year":"1992","author":"\u00e1","journal-title":"An Introduction to Parallel Algorithms","key":"ref18"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/140901.141917"},{"key":"ref28","article-title":"Efficient parallel ear decomposition with applications","author":"miller","year":"1986","journal-title":"Manuscript"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1006\/jpdc.1999.1541"},{"year":"1999","author":"mehlhorn","journal-title":"The LEDA Platform of Combinatorial and Geometric Computing","key":"ref27"},{"key":"ref3","article-title":"Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs","author":"bader","year":"2003","journal-title":"Technical Report 03–002"},{"key":"ref6","article-title":"Visualizing evolving networks: Minimum spanning trees versus pathfinder networks","author":"chen","year":"2003","journal-title":"IEEE Symp on Information Visualization"},{"key":"ref29","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"},{"key":"ref5","first-page":"194","article-title":"Minimum spanning tree analysis in advanced ovarian carcinoma","volume":"19","author":"brinkhuis","year":"1997","journal-title":"Anal Quant Cytol Histol"},{"key":"ref8","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)"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/375827.375847"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/42.876306"},{"key":"ref9","first-page":"11","article-title":"A linear-work parallel algorithm for finding minimum spanning trees","author":"cole","year":"1994","journal-title":"Proc 6th Ann Symp Parallel Algorithms and Architectures (SPAA-94)"},{"key":"ref1","first-page":"27","article-title":"Communication-optimal parallel minimum spanning tree algorithms","author":"adler","year":"1998","journal-title":"Proc 10th Ann Symp Parallel Algorithms and Architectures (SPAA-98)"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/978-3-540-39658-1_61"},{"key":"ref22","first-page":"225","article-title":"Minimum spanning tree, integrated optical density and lymph node metastasis in bronchial carcinoma","volume":"5","author":"kayser","year":"1993","journal-title":"Anal Cell Pathol"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1111\/j.1439-0264.1997.tb00113.x"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/0304-3975(86)90153-2"},{"key":"ref23","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"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/INFCOM.2001.916633"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1002\/cm.10053"}],"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\/01302953.pdf?arnumber=1302953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T11:38:46Z","timestamp":1585827526000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1302953\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2004.1302953","relation":{},"subject":[]}}