{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:25Z","timestamp":1772164045418,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T00:00:00Z","timestamp":1330128000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,2,25]]},"DOI":"10.1145\/2145816.2145842","type":"proceedings-article","created":{"date-parts":[[2012,2,28]],"date-time":"2012-02-28T07:58:45Z","timestamp":1330415925000},"page":"205-214","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Scalable parallel minimum spanning forest computation"],"prefix":"10.1145","author":[{"given":"Sadegh","family":"Nobari","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Thanh-Tung","family":"Cao","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"Rutgers University, Newark, NJ, USA"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Boost C++ graph library. http:\/\/www.boost.org.  Boost C++ graph library. http:\/\/www.boost.org."},{"key":"e_1_3_2_1_2_1","unstructured":"CUDA Zone: Toolkit & SDK. http:\/\/developer.nvidia.com\/what-cuda.  CUDA Zone: Toolkit & SDK. http:\/\/developer.nvidia.com\/what-cuda."},{"key":"e_1_3_2_1_3_1","unstructured":"CUDPP. http:\/\/cudpp.googlecode.com.  CUDPP. http:\/\/cudpp.googlecode.com."},{"key":"e_1_3_2_1_4_1","unstructured":"The Ninth DIMACS challenge on shortest paths. http:\/\/www.dis.uniroma1.it\/~challenge9\/.  The Ninth DIMACS challenge on shortest paths. http:\/\/www.dis.uniroma1.it\/~challenge9\/."},{"key":"e_1_3_2_1_5_1","unstructured":"GTgraph - A suite of synthetic random graph generators. https:\/\/sdm.lbl.gov\/~kamesh\/software\/GTgraph\/.  GTgraph - A suite of synthetic random graph generators. https:\/\/sdm.lbl.gov\/~kamesh\/software\/GTgraph\/."},{"key":"e_1_3_2_1_6_1","unstructured":"Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data.  Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2004.1302953"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.06.001"},{"key":"e_1_3_2_1_9_1","first-page":"37","volume-title":"O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm (about a certain minimal problem). Pr\u00e1ce mor. pr\u00edrodoved. spol. v Brne III","author":"Boruvka O.","year":"1926","unstructured":"O. Boruvka . O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm (about a certain minimal problem). Pr\u00e1ce mor. pr\u00edrodoved. spol. v Brne III , pages 37 -- 58 , 1926 . O. Boruvka. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm (about a certain minimal problem). Pr\u00e1ce mor. pr\u00edrodoved. spol. v Brne III, pages 37--58, 1926."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1266294"},{"key":"e_1_3_2_1_11_1","first-page":"302","article-title":"Parallel implementation of boruvka's minimum spanning tree algorithm. Parallel Processing Symposium","volume":"0","author":"Chung S.","year":"1996","unstructured":"S. Chung and A. Condon . Parallel implementation of boruvka's minimum spanning tree algorithm. Parallel Processing Symposium , International , 0 : 302 , 1996 . S. Chung and A. Condon. Parallel implementation of boruvka's minimum spanning tree algorithm. Parallel Processing Symposium, International, 0: 302, 1996.","journal-title":"International"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9260(96)00008-9"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. Stein , R. L. Rivest , and C. E. Leiserson . Introduction to algorithms . MIT Press , third edition, 2009 . ISBN 0070131511. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to algorithms. MIT Press, third edition, 2009. ISBN 0070131511."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/829523.830957"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007594"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142511"},{"key":"e_1_3_2_1_17_1","volume-title":"Md.","author":"Horowitz E.","year":"1978","unstructured":"E. Horowitz and S. Sahni . Fundamentals of computer algorithms. Potomac , Md. , Computer Science Press , 1978 . E. Horowitz and S. Sahni. Fundamentals of computer algorithms. Potomac, Md., Computer Science Press, 1978."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504182"},{"key":"e_1_3_2_1_20_1","volume-title":"Algorithm Design.","author":"Kleinberg J.","year":"2006","unstructured":"J. Kleinberg and \u00c9va Tardos . The minimum spanning tree problem . In Algorithm Design. Pearson\/Addison-Wesley , Boston , 2006 . J. Kleinberg and \u00c9va Tardos. The minimum spanning tree problem. In Algorithm Design. Pearson\/Addison-Wesley, Boston, 2006."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/582034.582089"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.77"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835882"},{"key":"e_1_3_2_1_24_1","volume-title":"DIMACS Monographs","author":"Moret B. M. E.","year":"1994","unstructured":"B. M. E. Moret and H. D. Shapiro . An empirical assessment of algorithms for constructing a minimal spanning tree . In DIMACS Monographs , 1994 . B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimal spanning tree. In DIMACS Monographs, 1994."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951406"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_27_1","volume-title":"Digital Image Processing","author":"Gonzalez P. W.","year":"1987","unstructured":"P. W. Rafael C. Gonzalez . Digital Image Processing . Addison-Wesley , 1987 . P. W. Rafael C. Gonzalez. Digital Image Processing. Addison-Wesley, 1987."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161005"},{"key":"e_1_3_2_1_29_1","volume-title":"Graphics Hardware","author":"Sengupta S.","year":"2007","unstructured":"S. Sengupta , M. Harris , Y. Zhang , and J. D. Owens . Scan primitives for GPU computing . In Graphics Hardware , 2007 . S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens. Scan primitives for GPU computing. In Graphics Hardware, 2007."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3485"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572769.1572796"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.37"},{"key":"e_1_3_2_1_33_1","volume-title":"Collective dynamics of 'small-world' networks. Nature, (393): 440--442","author":"Watts D. J.","year":"1998","unstructured":"D. J. Watts and S. H. Strogatz . Collective dynamics of 'small-world' networks. Nature, (393): 440--442 , 1998 . D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, (393): 440--442, 1998."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.4.536"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.07.010"}],"event":{"name":"PPoPP '12: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"New Orleans Louisiana USA","acronym":"PPoPP '12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2145816.2145842","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2145816.2145842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:54:52Z","timestamp":1750226092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2145816.2145842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":35,"alternative-id":["10.1145\/2145816.2145842","10.1145\/2145816"],"URL":"https:\/\/doi.org\/10.1145\/2145816.2145842","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2370036.2145842","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,2,25]]},"assertion":[{"value":"2012-02-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}