{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:29Z","timestamp":1750220249382,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:00:00Z","timestamp":1656374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DiPET (CHIST-ERA project)","award":["CHIST-ERA-18-SDCDN-002"],"award-info":[{"award-number":["CHIST-ERA-18-SDCDN-002"]}]},{"name":"High Performance Computing center of Queen's University Belfast and the Kelvin-2 supercomputer"},{"name":"EPSRC","award":["EP\/T022175\/1, EP\/T022345\/1"],"award-info":[{"award-number":["EP\/T022175\/1, EP\/T022345\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,28]]},"DOI":"10.1145\/3524059.3532365","type":"proceedings-article","created":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T16:13:11Z","timestamp":1655395991000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["MASTIFF"],"prefix":"10.1145","author":[{"given":"Mohsen","family":"Koohi Esfahani","sequence":"first","affiliation":[{"name":"Queen's University Belfast, Northern Ireland, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kilpatrick","sequence":"additional","affiliation":[{"name":"Queen's University Belfast, Northern Ireland, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Vandierendonck","sequence":"additional","affiliation":[{"name":"Queen's University Belfast, Northern Ireland, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,28]]},"reference":[{"unstructured":"Dan Alistarh Alexander Fedorov and Nikita Koval. 2019. In Search of the Fastest Concurrent Union-Find Algorithm. CoRR abs\/1911.06347 (2019). arXiv:1911.06347 http:\/\/arxiv.org\/abs\/1911.06347  Dan Alistarh Alexander Fedorov and Nikita Koval. 2019. In Search of the Fastest Concurrent Union-Find Algorithm. CoRR abs\/1911.06347 (2019). arXiv:1911.06347 http:\/\/arxiv.org\/abs\/1911.06347","key":"e_1_3_2_1_1_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/103418.103458"},{"key":"e_1_3_2_1_3_1","volume-title":"Bader and Paul Burkhardt","author":"David","year":"2019","unstructured":"David A. Bader and Paul Burkhardt . 2019 . A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges. CoRR abs\/1908.03473 (2019). arXiv:1908.03473 http:\/\/arxiv.org\/abs\/1908.03473 David A. Bader and Paul Burkhardt. 2019. A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges. CoRR abs\/1908.03473 (2019). arXiv:1908.03473 http:\/\/arxiv.org\/abs\/1908.03473"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/IPDPS.2004.1302953"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/ICPP.2005.55"},{"key":"e_1_3_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1002\/spe.587"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/3160017"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1963405.1963488"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/988672.988752"},{"unstructured":"Otakar Bor\u016fvka. 1926. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. http:\/\/dml.cz\/dmlcz\/500114  Otakar Bor\u016fvka. 1926. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. http:\/\/dml.cz\/dmlcz\/500114","key":"e_1_3_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/3060621.3060701"},{"volume-title":"ICWSM. AAAI Conference on Weblogs and Social Media 14","author":"Cha Meeyoung","unstructured":"Meeyoung Cha , Hamed Haddadi , Fabricio Benevenuto , and Krishna P. Gummadi . 2010. Measuring User Influence in Twitter: The Million Follower Fallacy , In ICWSM. AAAI Conference on Weblogs and Social Media 14 . Meeyoung Cha, Hamed Haddadi, Fabricio Benevenuto, and Krishna P. Gummadi. 2010. Measuring User Influence in Twitter: The Million Follower Fallacy, In ICWSM. AAAI Conference on Weblogs and Social Media 14.","key":"e_1_3_2_1_13_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/2741948.2741970"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/IPPS.1996.508073"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/11945918_55"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/HPCC-SmartCity-DSS.2016.0037"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/99.660313"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/3434393"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/2907294.2907300"},{"unstructured":"Jason Eisner. 1997. State-of-the-Art Algorithms for Minimum Spanning Trees - A Tutorial Discussion. https:\/\/www.cs.jhu.edu\/~jason\/papers\/eisner.mst-tutorial.pdf  Jason Eisner. 1997. State-of-the-Art Algorithms for Minimum Spanning Trees - A Tutorial Discussion. https:\/\/www.cs.jhu.edu\/~jason\/papers\/eisner.mst-tutorial.pdf","key":"e_1_3_2_1_22_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/HPEC49654.2021.9622864"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.3389\/fnins.2017.00639"},{"unstructured":"Vojt\u011bch Jarn\u00edk. 1930. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm.(Z dopisu panu O. Bor\u016fvkovi). http:\/\/dml.cz\/dmlcz\/500726  Vojt\u011bch Jarn\u00edk. 1930. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm.(Z dopisu panu O. Bor\u016fvkovi). http:\/\/dml.cz\/dmlcz\/500726","key":"e_1_3_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1109\/IPDPSW.2012.201"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/3472456.3472462"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/ISPASS51385.2021.00023"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1109\/IISWC53511.2021.00020"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1109\/Cluster48925.2021.00042"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3503221.3508402"},{"key":"e_1_3_2_1_32_1","volume-title":"SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs. In 2022 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). IEEE Computer Society.","author":"Esfahani Mohsen Koohi","year":"2022","unstructured":"Mohsen Koohi Esfahani , Peter Kilpatrick , and Hans Vandierendonck . 2022 . SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs. In 2022 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). IEEE Computer Society. Mohsen Koohi Esfahani, Peter Kilpatrick, and Hans Vandierendonck. 2022. SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs. In 2022 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). IEEE Computer Society."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.2307\/2033241"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/2487788.2488173"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1145\/1772690.1772751"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1145\/2615569.2615674"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1109\/CINTI.2012.6496797"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1145\/2567948.2576928"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1561\/106.00000003"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1016\/S0196-6774(03)00076-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1109\/ECS.2015.7124947"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1145\/1298306.1298311"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1145\/2517349.2522739"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1145\/2370036.2145842"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1145\/3225058.3225146"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","author":"Ryan","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization . In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence ( Austin, Texas) (AAAI'15). AAAI Press, USA, 4292--4293. Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Austin, Texas) (AAAI'15). AAAI Press, USA, 4292--4293.","key":"e_1_3_2_1_47_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1504\/IJCSE.2013.052115"},{"unstructured":"Youcef Saad. 1994. Sparskit: a basic tool kit for sparse matrix computations - Version 2.  Youcef Saad. 1994. Sparskit: a basic tool kit for sparse matrix computations - Version 2.","key":"e_1_3_2_1_49_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1145\/2588555.2610518"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_51_1","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"e_1_3_2_1_52_1","volume-title":"Friendster: The online gaming social network. archive.org\/details\/friendster-dataset-201107.","author":"Friendster","year":"2011","unstructured":"Friendster social network. 2011 . Friendster: The online gaming social network. archive.org\/details\/friendster-dataset-201107. Friendster social network. 2011. Friendster: The online gaming social network. archive.org\/details\/friendster-dataset-201107."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_53_1","DOI":"10.1128\/JCM.42.9.4230-4236.2004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_54_1","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_2_1_55_1","volume-title":"Nikolopoulos","author":"Sun Jiawen","year":"2018","unstructured":"Jiawen Sun , Hans Vandierendonck , and Dimitrios S . Nikolopoulos . 2018 . VEBO : A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing. CoRR abs\/1806.06576 (2018), 1--13. arXiv:1806.06576 http:\/\/arxiv.org\/abs\/1806.06576 Jiawen Sun, Hans Vandierendonck, and Dimitrios S. Nikolopoulos. 2018. VEBO: A Vertex- and Edge-Balanced Ordering Heuristic to Load Balance Parallel Graph Processing. CoRR abs\/1806.06576 (2018), 1--13. arXiv:1806.06576 http:\/\/arxiv.org\/abs\/1806.06576"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_56_1","DOI":"10.1145\/321879.321884"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_57_1","DOI":"10.1007\/978-3-642-11261-4_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.1002\/hbm.24014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_59_1","DOI":"10.1145\/301631.301657"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_60_1","DOI":"10.1145\/1572769.1572796"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_61_1","DOI":"10.1063\/1.4908014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_62_1","DOI":"10.1109\/CGO.2017.7863726"},{"volume-title":"A Practical Scalable Shared-Memory Parallel Algorithm for Computing Minimum Spanning Trees. Master's thesis","author":"Zhou Wei","unstructured":"Wei Zhou . 2017. A Practical Scalable Shared-Memory Parallel Algorithm for Computing Minimum Spanning Trees. Master's thesis . Karlsruhe Institute of Technology . https:\/\/algo2.iti.kit.edu\/english\/3333.php Wei Zhou. 2017. A Practical Scalable Shared-Memory Parallel Algorithm for Computing Minimum Spanning Trees. Master's thesis. Karlsruhe Institute of Technology. https:\/\/algo2.iti.kit.edu\/english\/3333.php","key":"e_1_3_2_1_63_1"}],"event":{"sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"acronym":"ICS '22","name":"ICS '22: 2022 International Conference on Supercomputing","location":"Virtual Event"},"container-title":["Proceedings of the 36th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3524059.3532365","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3524059.3532365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:37Z","timestamp":1750188637000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3524059.3532365"}},"subtitle":["structure-aware minimum spanning tree\/forest"],"short-title":[],"issued":{"date-parts":[[2022,6,28]]},"references-count":62,"alternative-id":["10.1145\/3524059.3532365","10.1145\/3524059"],"URL":"https:\/\/doi.org\/10.1145\/3524059.3532365","relation":{},"subject":[],"published":{"date-parts":[[2022,6,28]]},"assertion":[{"value":"2022-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}