{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T18:10:12Z","timestamp":1765303812731,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":79,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T00:00:00Z","timestamp":1593388800000},"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":[[2020,6,29]]},"DOI":"10.1145\/3392717.3392745","type":"proceedings-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T18:49:02Z","timestamp":1593456542000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Parallelizing pruned landmark labeling"],"prefix":"10.1145","author":[{"given":"Ruoming","family":"Jin","sequence":"first","affiliation":[{"name":"Kent State University"}]},{"given":"Zhen","family":"Peng","sequence":"additional","affiliation":[{"name":"William & Mary"}]},{"given":"Wendell","family":"Wu","sequence":"additional","affiliation":[{"name":"Kent State University"}]},{"given":"Feodor","family":"Dragan","sequence":"additional","affiliation":[{"name":"Kent State University"}]},{"given":"Gagan","family":"Agrawal","sequence":"additional","affiliation":[{"name":"Augusta University"}]},{"given":"Bin","family":"Ren","sequence":"additional","affiliation":[{"name":"William & Mary"}]}],"member":"320","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Werneck","author":"Abraham Ittai","year":"2011","unstructured":"Ittai Abraham , Daniel Delling , Andrew V. Goldberg , and Renato F . Werneck . 2011 . A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In Experimental Algorithms, Panos M. Pardalos and Steffen Rebennack (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 230--241. Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2011. A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In Experimental Algorithms, Panos M. Pardalos and Steffen Rebennack (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 230--241."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2582735"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_4_1","volume-title":"Mathematical Foundations of Computer Science","author":"Babenko Maxim","year":"2015","unstructured":"Maxim Babenko , Andrew V. Goldberg , Haim Kaplan , Ruslan Savchenko , and Mathias Weller . 2015. On the Complexity of Hub Labeling (Extended Abstract) . In Mathematical Foundations of Computer Science 2015 . Springer Berlin Heidelberg , 62--74. Maxim Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, and Mathias Weller. 2015. On the Complexity of Hub Labeling (Extended Abstract). In Mathematical Foundations of Computer Science 2015. Springer Berlin Heidelberg, 62--74."},{"key":"e_1_3_2_1_5_1","volume-title":"SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS)","author":"Besta Maciej","year":"2017","unstructured":"Maciej Besta , Florian Marending , Edgar Solomonik , and Torsten Hoefler . 2017 . SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS) , 2017 IEEE International. IEEE, 32--41. Maciej Besta, Florian Marending, Edgar Solomonik, and Torsten Hoefler. 2017. SlimSell: A Vectorizable Graph Representation for Breadth-First Search. In Parallel and Distributed Processing Symposium (IPDPS), 2017 IEEE International. IEEE, 32--41."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806512"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282100.1282167"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.88"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854038.2854046"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_56"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353370"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.169"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms. 937--946","author":"Cohen Edith","year":"2002","unstructured":"Edith Cohen , Eran Halperin , Haim Kaplan , and Uri Zwick . 2002 . Reachability and distance queries via 2-hop labels . In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms. 937--946 . Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. 2002. Reachability and distance queries via 2-hop labels. In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms. 937--946."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192404"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547548"},{"volume-title":"A fast and efficient parallel algorithm for pruned landmark labeling. In 2018 IEEE High Performance extreme Computing Conference (HPEC)","author":"Dong Qing","key":"e_1_3_2_1_19_1","unstructured":"Qing Dong , Kartik Lakhotia , Hanqing Zeng , Rajgopal Karman , Viktor Prasanna , and Guna Seetharaman . 2018. A fast and efficient parallel algorithm for pruned landmark labeling. In 2018 IEEE High Performance extreme Computing Conference (HPEC) . IEEE , 1--7. Qing Dong, Kartik Lakhotia, Hanqing Zeng, Rajgopal Karman, Viktor Prasanna, and Guna Seetharaman. 2018. A fast and efficient parallel algorithm for pruned landmark labeling. In 2018 IEEE High Performance extreme Computing Conference (HPEC). IEEE, 1--7."},{"key":"e_1_3_2_1_21_1","volume-title":"2014 23rd International Conference on Parallel Architecture and Compilation Techniques (PACT). IEEE, 27--38","author":"Fidel Adam","year":"2014","unstructured":"Adam Fidel , Nancy M Amato , Lawrence Rauchwerger , 2014 . Kla: A new algorithmic paradigm for parallel graph computations . In 2014 23rd International Conference on Parallel Architecture and Compilation Techniques (PACT). IEEE, 27--38 . Adam Fidel, Nancy M Amato, Lawrence Rauchwerger, et al. 2014. Kla: A new algorithmic paradigm for parallel graph computations. In 2014 23rd International Conference on Parallel Architecture and Compilation Techniques (PACT). IEEE, 27--38."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2018.00015"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3307681.3326606"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"volume-title":"Graph theory and sparse matrix computation","author":"George Alan","key":"e_1_3_2_1_25_1","unstructured":"Alan George , John R Gilbert , and Joseph WH Liu . 2012. Graph theory and sparse matrix computation . Vol. 56 . Springer Science & Business Media . Alan George, John R Gilbert, and Joseph WH Liu. 2012. Graph theory and sparse matrix computation. Vol. 56. Springer Science & Business Media."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370816.2370866"},{"key":"e_1_3_2_1_27_1","first-page":"2","article-title":"PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs","volume":"12","author":"Gonzalez Joseph E","year":"2012","unstructured":"Joseph E Gonzalez , Yucheng Low , Haijie Gu , Danny Bickson , and Carlos Guestrin . 2012 . PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs .. In OSDI , Vol. 12. 2 . Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs.. In OSDI, Vol. 12. 2.","journal-title":"OSDI"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.41"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2017.48"},{"key":"e_1_3_2_1_30_1","volume-title":"Efficient Parallel Graph Exploration on Multi-core CPU and GPU. In 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 78--88","author":"Hong Sungpack","year":"2011","unstructured":"Sungpack Hong , Tayo Oguntebi , and Kunle Olukotun . 2011 . Efficient Parallel Graph Exploration on Multi-core CPU and GPU. In 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 78--88 . Sungpack Hong, Tayo Oguntebi, and Kunle Olukotun. 2011. Efficient Parallel Graph Exploration on Multi-core CPU and GPU. In 2011 International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 78--88."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157799"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926285"},{"key":"e_1_3_2_1_33_1","volume-title":"Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! arXiv preprint arXiv:1906.12018","author":"Jin Ruoming","year":"2019","unstructured":"Ruoming Jin , Zhen Peng , Wendell Wu , Feodor Dragan , Gagan Agrawal , and Bin Ren . 2019. Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! arXiv preprint arXiv:1906.12018 ( 2019 ). Ruoming Jin, Zhen Peng, Wendell Wu, Feodor Dragan, Gagan Agrawal, and Bin Ren. 2019. Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage! arXiv preprint arXiv:1906.12018 (2019)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"R. Jin N. Ruan Y. Xiang and V. E. Lee. 2012. A highway-centric labeling approach for answering distance queries on large sparse graphs. In SIGMOD.  R. Jin N. Ruan Y. Xiang and V. E. Lee. 2012. A highway-centric labeling approach for answering distance queries on large sparse graphs. In SIGMOD.","DOI":"10.1145\/2213836.2213887"},{"key":"e_1_3_2_1_35_1","volume-title":"Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks. CoRR abs\/1305.0507","author":"Jin Ruoming","year":"2013","unstructured":"Ruoming Jin , Ning Ruan , Bo You , and Haixun Wang . 2013. Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks. CoRR abs\/1305.0507 ( 2013 ). Ruoming Jin, Ning Ruan, Bo You, and Haixun Wang. 2013. Hub-Accelerator: Fast and Exact Shortest Path Computation in Large Social Networks. CoRR abs\/1305.0507 (2013)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556578"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761646"},{"volume-title":"Graph Algorithms in the Language of Linear Algebra","author":"Kepner Jeremy","key":"e_1_3_2_1_38_1","unstructured":"Jeremy Kepner and John Gilbert . 2011. Graph Algorithms in the Language of Linear Algebra . Vol. 22 . SIAM. Jeremy Kepner and John Gilbert. 2011. Graph Algorithms in the Language of Linear Algebra. Vol. 22. SIAM."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196915"},{"key":"e_1_3_2_1_41_1","volume-title":"10th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX.","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola , Guy E Blelloch , and Carlos Guestrin . 2012 . Graphchi: Large-Scale Graph Computation on Just a PC . In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX. Aapo Kyrola, Guy E Blelloch, and Carlos Guestrin. 2012. Graphchi: Large-Scale Graph Computation on Just a PC. In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372722"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319877"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164141"},{"key":"e_1_3_2_1_45_1","volume-title":"Simd-x: Programming and processing of graph algorithms on gpus. arXiv preprint arXiv:1812.04070","author":"Liu Hang","year":"2018","unstructured":"Hang Liu and H Howie Huang . 2018 . Simd-x: Programming and processing of graph algorithms on gpus. arXiv preprint arXiv:1812.04070 (2018). Hang Liu and H Howie Huang. 2018. Simd-x: Programming and processing of graph algorithms on gpus. arXiv preprint arXiv:1812.04070 (2018)."},{"key":"e_1_3_2_1_46_1","volume-title":"Graphlab: A New Framework for Parallel Machine Learning. arXiv preprint arXiv:1408.2041","author":"Low Yucheng","year":"2014","unstructured":"Yucheng Low , Joseph E Gonzalez , Aapo Kyrola , Danny Bickson , Carlos E Guestrin , and Joseph Hellerstein . 2014 . Graphlab: A New Framework for Parallel Machine Learning. arXiv preprint arXiv:1408.2041 (2014). Yucheng Low, Joseph E Gonzalez, Aapo Kyrola, Danny Bickson, Carlos E Guestrin, and Joseph Hellerstein. 2014. Graphlab: A New Framework for Parallel Machine Learning. arXiv preprint arXiv:1408.2041 (2014)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295716"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984015"},{"key":"e_1_3_2_1_55_1","volume-title":"SC12","author":"Krste Asanovic David Patterson Scott Beamer","year":"2012","unstructured":"Scott Beamer Krste Asanovic David Patterson . 2012 . Direction-Optimizing Breadth-First Search . SC12 , November (2012), 10--16. Scott Beamer Krste Asanovic David Patterson. 2012. Direction-Optimizing Breadth-First Search. SC12, November (2012), 10--16."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243176.3243205"},{"volume-title":"2016 IEEE 24th International Conference on Network Protocols (ICNP). IEEE, 1--10","author":"Xu Qiongwen","key":"e_1_3_2_1_57_1","unstructured":"Qiongwen Xu , Xu Zhang , Jin Zhao , Xin Wang , and T. Wolf . 2016. Fast shortest-path queries on large-scale graphs . In 2016 IEEE 24th International Conference on Network Protocols (ICNP). IEEE, 1--10 . Qiongwen Xu, Xu Zhang, Jin Zhao, Xin Wang, and T. Wolf. 2016. Fast shortest-path queries on large-scale graphs. In 2016 IEEE 24th International Conference on Network Protocols (ICNP). IEEE, 1--10."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225061"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0405-2"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183471.1183506"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"crossref","unstructured":"J. Sankaranarayanan H. Samet and H. Alborzi. 2009. Path oracles for spatial networks. PVLDB 2 (August 2009). Issue 1.  J. Sankaranarayanan H. Samet and H. Alborzi. 2009. Path oracles for spatial networks. PVLDB 2 (August 2009). Issue 1.","DOI":"10.14778\/1687627.1687763"},{"key":"e_1_3_2_1_64_1","volume-title":"HOPI: An Efficient Connection Index for Complex XML Document Collections. In Advances in Database Technology - EDBT","author":"Schenkel Ralf","year":"2004","unstructured":"Ralf Schenkel , Anja Theobald , and Gerhard Weikum . 2004 . HOPI: An Efficient Connection Index for Complex XML Document Collections. In Advances in Database Technology - EDBT 2004, Elisa Bertino, Stavros Christodoulakis , Dimitris Plexousakis, Vassilis Christophides, Manolis Koubarakis, Klemens B\u00f6hm, and Elena Ferrari (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 237--255. Ralf Schenkel, Anja Theobald, and Gerhard Weikum. 2004. HOPI: An Efficient Connection Index for Complex XML Document Collections. In Advances in Database Technology - EDBT 2004, Elisa Bertino, Stavros Christodoulakis, Dimitris Plexousakis, Vassilis Christophides, Manolis Koubarakis, Klemens B\u00f6hm, and Elena Ferrari (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 237--255."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/WACCPD.2016.012"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807655"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.105"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCSim.2014.6903668"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079097"},{"key":"e_1_3_2_1_72_1","volume-title":"Md Mostofa Ali Patwary, Subramanya R Dulloor, Satya Gautam Vadlamudi, Dipankar Das, and Pradeep Dubey.","author":"Sundaram Narayanan","year":"2015","unstructured":"Narayanan Sundaram , Nadathur Rajagopalan Satish , Md Mostofa Ali Patwary, Subramanya R Dulloor, Satya Gautam Vadlamudi, Dipankar Das, and Pradeep Dubey. 2015 . Graphmat : High performance graph analytics made productive. arXiv preprint arXiv:1503.07241 (2015). Narayanan Sundaram, Nadathur Rajagopalan Satish, Md Mostofa Ali Patwary, Subramanya R Dulloor, Satya Gautam Vadlamudi, Dipankar Das, and Pradeep Dubey. 2015. Graphmat: High performance graph analytics made productive. arXiv preprint arXiv:1503.07241 (2015)."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_3_2_1_75_1","volume-title":"Optimal Hub Labeling is NP-complete. CoRR abs\/1407.8373","author":"Weller Mathias","year":"2014","unstructured":"Mathias Weller . 2014. Optimal Hub Labeling is NP-complete. CoRR abs\/1407.8373 ( 2014 ). Mathias Weller. 2014. Optimal Hub Labeling is NP-complete. CoRR abs\/1407.8373 (2014)."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858788.2688507"},{"key":"e_1_3_2_1_78_1","volume-title":"GraphIt: A High-Performance DSL for Graph Analytics. arXiv preprint arXiv:1805.00923","author":"Zhang Yunming","year":"2018","unstructured":"Yunming Zhang , Mengjiao Yang , Riyadh Baghdadi , Shoaib Kamil , Julian Shun , and Saman Amarasinghe . 2018. GraphIt: A High-Performance DSL for Graph Analytics. arXiv preprint arXiv:1805.00923 ( 2018 ). Yunming Zhang, Mengjiao Yang, Riyadh Baghdadi, Shoaib Kamil, Julian Shun, and Saman Amarasinghe. 2018. GraphIt: A High-Performance DSL for Graph Analytics. arXiv preprint arXiv:1805.00923 (2018)."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.111"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2611659"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687734"}],"event":{"name":"ICS '20: 2020 International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Barcelona Spain","acronym":"ICS '20"},"container-title":["Proceedings of the 34th ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3392717.3392745","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3392717.3392745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:15Z","timestamp":1750200075000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3392717.3392745"}},"subtitle":["dealing with dependencies in graph algorithms"],"short-title":[],"issued":{"date-parts":[[2020,6,29]]},"references-count":79,"alternative-id":["10.1145\/3392717.3392745","10.1145\/3392717"],"URL":"https:\/\/doi.org\/10.1145\/3392717.3392745","relation":{},"subject":[],"published":{"date-parts":[[2020,6,29]]},"assertion":[{"value":"2020-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}