{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T23:15:21Z","timestamp":1778886921178,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T00:00:00Z","timestamp":1699660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1955367"],"award-info":[{"award-number":["1955367"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,12]]},"DOI":"10.1145\/3581784.3607093","type":"proceedings-article","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T21:47:06Z","timestamp":1699998426000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A High-Performance MST Implementation for GPUs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9200-6260","authenticated-orcid":false,"given":"Alex","family":"Fallin","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, Texas State University, San Marcos, Texas, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3305-2539","authenticated-orcid":false,"given":"Andres","family":"Gonzalez","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Texas State University, San Marcos, Texas, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5023-5284","authenticated-orcid":false,"given":"Jarim","family":"Seo","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Texas State University, San Marcos, Texas, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7717-3354","authenticated-orcid":false,"given":"Martin","family":"Burtscher","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Texas State University, San Marcos, Texas, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.391737"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145840"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(82)90010-4"},{"key":"e_1_3_2_1_4_1","volume-title":"Leonard T Schuurmans, and JP Baak.","author":"Brinkhuis Mariel","year":"1997","unstructured":"Mariel Brinkhuis , Gerrit A Meijer , Paul J Van Diest , Leonard T Schuurmans, and JP Baak. 1997 . Minimum spanning tree analysis in advanced ovarian carcinoma. An investigation of sampling methods, reproducibility and correlation with histologic grade. Analytical and quantitative cytology and histology 19, 3 (1997), 194--201. Mariel Brinkhuis, Gerrit A Meijer, Paul J Van Diest, Leonard T Schuurmans, and JP Baak. 1997. Minimum spanning tree analysis in advanced ovarian carcinoma. An investigation of sampling methods, reproducibility and correlation with histologic grade. Analytical and quantitative cytology and histology 19, 3 (1997), 194--201."},{"key":"e_1_3_2_1_5_1","unstructured":"Martin Burtscher and Alex Fallin. 2023. ECL-MST Git Repository. https:\/\/github.com\/burtscher\/ECL-MST. Accessed: 2023-08-18.  Martin Burtscher and Alex Fallin. 2023. ECL-MST Git Repository. https:\/\/github.com\/burtscher\/ECL-MST. Accessed: 2023-08-18."},{"key":"e_1_3_2_1_6_1","unstructured":"Martin Burtscher and Alex Fallin. 2023. ECL-MST Website. https:\/\/cs.txstate.edu\/~burtscher\/research\/ECL-MST\/. Accessed: 2023-08-18.  Martin Burtscher and Alex Fallin. 2023. ECL-MST Website. https:\/\/cs.txstate.edu\/~burtscher\/research\/ECL-MST\/. Accessed: 2023-08-18."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CAHPC.2018.8645917"},{"key":"e_1_3_2_1_9_1","unstructured":"DIMACS data sets 2007. DIMACS data sets. https:\/\/www.diag.uniroma1.it\/challenge9\/download.shtml  DIMACS data sets 2007. DIMACS data sets. https:\/\/www.diag.uniroma1.it\/challenge9\/download.shtml"},{"key":"e_1_3_2_1_10_1","unstructured":"Galois data sets 2018. Galois data sets. https:\/\/iss.oden.utexas.edu\/?p=projects\/galois  Galois data sets 2018. Galois data sets. https:\/\/iss.oden.utexas.edu\/?p=projects\/galois"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1985.10011"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208040.3208041"},{"key":"e_1_3_2_1_15_1","volume-title":"GPU","author":"Jucele","year":"2018","unstructured":"Jucele GPU 2018 . Jucele GPU. https:\/\/github.com\/jucele\/NewMinimumSpanningTree\/ Jucele GPU 2018. Jucele GPU. https:\/\/github.com\/jucele\/NewMinimumSpanningTree\/"},{"key":"e_1_3_2_1_16_1","volume-title":"Improved GPU sorting. GPU gems 2","author":"Kipfer Peter","year":"2005","unstructured":"Peter Kipfer and R\u00fcdiger Westermann . 2005. Improved GPU sorting. GPU gems 2 ( 2005 ), 733--746. Peter Kipfer and R\u00fcdiger Westermann. 2005. Improved GPU sorting. GPU gems 2 (2005), 733--746."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1743666.1743682"},{"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","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_20_1","volume-title":"CPU","author":"Lonestar","year":"2022","unstructured":"Lonestar CPU 2022 . Lonestar CPU. https:\/\/github.com\/IntelligentSoftwareSystems\/Galois\/ Lonestar CPU 2022. Lonestar CPU. https:\/\/github.com\/IntelligentSoftwareSystems\/Galois\/"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2015.72"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.28"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW55747.2022.00061"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791220.2791225"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984015"},{"key":"e_1_3_2_1_27_1","unstructured":"PBBS Codes 2012. PBBS Codes. https:\/\/github.com\/cmuparlay\/pbbsbench\/  PBBS Codes 2012. PBBS Codes. https:\/\/github.com\/cmuparlay\/pbbsbench\/"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_29_1","volume-title":"GPU","author":"Graph RAPIDS","year":"2022","unstructured":"RAPIDS cu Graph GPU 2022 . RAPIDS cuGraph GPU. https:\/\/github.com\/rapidsai\/cugraph\/ RAPIDS cuGraph GPU 2022. RAPIDS cuGraph GPU. https:\/\/github.com\/rapidsai\/cugraph\/"},{"key":"e_1_3_2_1_30_1","unstructured":"RAPIDS Raft 2022. RAPIDS Raft. https:\/\/github.com\/rapidsai\/raft\/  RAPIDS Raft 2022. RAPIDS Raft. https:\/\/github.com\/rapidsai\/raft\/"},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. International Conference on High Performance Computing (HiPC). 1--5.","author":"Setia Rohit","year":"2009","unstructured":"Rohit Setia , Arun Nedunchezhian , and Shankar Balachandran . 2009 . A new parallel algorithm for minimum spanning tree problem . In Proc. International Conference on High Performance Computing (HiPC). 1--5. Rohit Setia, Arun Nedunchezhian, and Shankar Balachandran. 2009. A new parallel algorithm for minimum spanning tree problem. In Proc. International Conference on High Performance Computing (HiPC). 1--5."},{"key":"e_1_3_2_1_32_1","unstructured":"UMinho Codes 2015. UMinho Codes. https:\/\/github.com\/Beatgodes\/BoruvkaUMinho\/  UMinho Codes 2015. UMinho Codes. https:\/\/github.com\/Beatgodes\/BoruvkaUMinho\/"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5815\/ijmecs.2011.03.08"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3108140"}],"event":{"name":"SC '23: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Denver CO USA","acronym":"SC '23","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3581784.3607093","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3581784.3607093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:23Z","timestamp":1750178183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,11]]},"references-count":34,"alternative-id":["10.1145\/3581784.3607093","10.1145\/3581784"],"URL":"https:\/\/doi.org\/10.1145\/3581784.3607093","relation":{},"subject":[],"published":{"date-parts":[[2023,11,11]]},"assertion":[{"value":"2023-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}