{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T02:33:57Z","timestamp":1776134037185,"version":"3.50.1"},"reference-count":181,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:00:00Z","timestamp":1728518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62472225, U2241211 and U20B2046"],"award-info":[{"award-number":["62472225, U2241211 and U20B2046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2025,2,28]]},"abstract":"<jats:p>Distributed processing of large-scale graph data has many practical applications and has been widely studied. In recent years, a lot of distributed graph processing frameworks and algorithms have been proposed. While many efforts have been devoted to analyzing these, with most analyzing them based on programming models, less research focuses on understanding their challenges in distributed environments. Applying graph tasks to distributed environments is not easy, often facing numerous challenges through our analysis, including parallelism, load balancing, communication overhead, and bandwidth. In this article, we provide an extensive overview of the current state-of-the-art in this field by outlining the challenges and solutions of distributed graph algorithms. We first conduct a systematic analysis of the inherent challenges in distributed graph processing, followed by presenting an overview of existing general solutions. Subsequently, we survey the challenges highlighted in recent distributed graph processing papers and the strategies adopted to address them. Finally, we discuss the current research trends and identify potential future opportunities.<\/jats:p>","DOI":"10.1145\/3694966","type":"journal-article","created":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:09:49Z","timestamp":1725552589000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["A Survey of Distributed Graph Algorithms on Massive Graphs"],"prefix":"10.1145","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7961-9131","authenticated-orcid":false,"given":"Lingkai","family":"Meng","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0940-065X","authenticated-orcid":false,"given":"Yu","family":"Shao","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8111-0401","authenticated-orcid":false,"given":"Long","family":"Yuan","sequence":"additional","affiliation":[{"name":"Nanjing University of Science and Technology, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4735-3835","authenticated-orcid":false,"given":"Longbin","family":"Lai","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9797-6944","authenticated-orcid":false,"given":"Peng","family":"Cheng","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5713-7225","authenticated-orcid":false,"given":"Xue","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5641-2452","authenticated-orcid":false,"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-7225","authenticated-orcid":false,"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4220-2634","authenticated-orcid":false,"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2024,10,10]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.120"},{"key":"e_1_3_1_3_2","series-title":"LIPIcs","first-page":"6:1\u20136:17","volume-title":"DISC 2018","year":"2018","unstructured":"Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman. 2018. Distributed approximate maximum matching in the CONGEST model. In DISC 2018(LIPIcs, Vol. 121). 6:1\u20136:17."},{"key":"e_1_3_1_4_2","first-page":"262","volume-title":"PPoPP 2020","year":"2020","unstructured":"Ghadeer Alabandi, Evan Powers, and Martin Burtscher. 2020. Increasing the parallelism of graph coloring via shortcutting. In PPoPP 2020. 262\u2013275."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.03.014"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.14778\/3184470.3184473"},{"issue":"5","key":"e_1_3_1_7_2","first-page":"68:1\u201368:40","article-title":"Foundations of modern query languages for graph databases","volume":"50","year":"2017","unstructured":"Renzo Angles, Marcelo Arenas, Pablo Barcel\u00f3, Aidan Hogan, Juan L. Reutter, and Domagoj Vrgoc. 2017. Foundations of modern query languages for graph databases. ACM Comput. Surv. 50, 5 (2017), 68:1\u201368:40.","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_1_8_2","unstructured":"Shaikh Arifuzzaman Maleq Khan and Madhav V. Marathe. 2017. Distributed-memory parallel algorithms for counting and listing triangles in big graphs. CoRR abs\/1706.05151 (2017). arXiv:1706.05151."},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1810891.1810910"},{"key":"e_1_3_1_10_2","first-page":"81","volume-title":"NIPS 2008","year":"2008","unstructured":"Arthur U. Asuncion, Padhraic Smyth, and Max Welling. 2008. Asynchronous distributed learning of topic models. In NIPS 2008. Curran Associates, Inc., 81\u201388."},{"key":"e_1_3_1_11_2","unstructured":"Jean-Philippe Attal Maria Malek and Marc Zolghadri. 2019. Parallel and distributed core label propagation with graph coloring. Concurr. Comput. Pract. Exp. 31 2 (2019) e4355."},{"issue":"3","key":"e_1_3_1_12_2","first-page":"5","article-title":"Giraph: Large-scale graph processing infrastructure on Hadoop","volume":"11","author":"Avery Ching","year":"2011","unstructured":"Ching Avery. 2011. Giraph: Large-scale graph processing infrastructure on Hadoop. Proceedings of the Hadoop Summit. Santa Clara 11, 3 (2011), 5\u20139.","journal-title":"Proceedings of the Hadoop Summit. Santa Clara"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2015.62"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.08.045"},{"key":"e_1_3_1_15_2","first-page":"38","volume-title":"COMAD 2014","author":"Badam Nitin Chandra","year":"2014","unstructured":"Nitin Chandra Badam and Yogesh Simmhan. 2014. Subgraph rank: PageRank for subgraph-centric distributed graph processing. In COMAD 2014. 38\u201349."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2022.3152945"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/72551.72552"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1137\/19M1286955"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.09.013"},{"key":"e_1_3_1_20_2","first-page":"1122","volume-title":"IPDPS 2020","year":"2020","unstructured":"Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar R\u00e4tsch, Torsten Hoefler, and Edgar Solomonik. 2020. Communication-efficient Jaccard similarity for high-performance distributed genome comparisons. In IPDPS 2020. 1122\u20131132."},{"key":"e_1_3_1_21_2","doi-asserted-by":"crossref","unstructured":"Vincent D. Blondel Jean-Loup Guillaume Renaud Lambiotte and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008 10 (2008) P10008.","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_1_22_2","first-page":"54","volume-title":"IA3 2020","year":"2020","unstructured":"Ian Bogle, Erik G. Boman, Karen D. Devine, Sivasankaran Rajamanickam, and George M. Slota. 2020. Distributed memory graph coloring algorithms for multiple GPUs. In IA3 2020. 54\u201362."},{"key":"e_1_3_1_23_2","series-title":"LIPIcs","first-page":"132:1\u2013132:15","volume-title":"ICALP 2019","author":"Bonne Matthias","year":"2019","unstructured":"Matthias Bonne and Keren Censor-Hillel. 2019. Distributed detection of cliques in dynamic networks. In ICALP 2019(LIPIcs, Vol. 132). 132:1\u2013132:15."},{"key":"e_1_3_1_24_2","first-page":"47","volume-title":"ISMB 2005","year":"2005","unstructured":"Karsten M. Borgwardt, Cheng Soon Ong, Stefan Sch\u00f6nauer, S. V. N. Vishwanathan, Alexander J. Smola, and Hans-Peter Kriegel. 2005. Protein function prediction via graph kernels. In ISMB 2005. 47\u201356."},{"issue":"2","key":"e_1_3_1_25_2","first-page":"36:1\u201336:35","article-title":"A survey on distributed graph pattern matching in massive graphs","volume":"54","year":"2022","unstructured":"Sarra Bouhenni, Sa\u00efd Yahiaoui, Nadia Nouali-Taboudjemat, and Hamamache Kheddouci. 2022. A survey on distributed graph pattern matching in massive graphs. ACM Comput. Surv. 54, 2 (2022), 36:1\u201336:35.","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_1_26_2","doi-asserted-by":"crossref","unstructured":"Ulrik Brandes. 2001. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25 2 (2001) 163\u2013177.","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_1_27_2","doi-asserted-by":"crossref","unstructured":"Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30 1\u20137 (1998) 107\u2013117.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2330597"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2485994"},{"key":"e_1_3_1_31_2","first-page":"234","volume-title":"PPoPP 2022","year":"2022","unstructured":"Huanqi Cao, Yuanwei Wang, Haojie Wang, Heng Lin, Zixuan Ma, Wanwang Yin, and Wenguang Chen. 2022. Scaling graph traversal to 281 trillion edges with 40 million cores. In PPoPP 2022. 234\u2013245."},{"key":"e_1_3_1_32_2","first-page":"493","volume-title":"PODC 2021","year":"2021","unstructured":"Nairen Cao, Jeremy T. Fineman, and Katina Russell. 2021. Brief announcement: An improved distributed approximate single source shortest paths algorithm. In PODC 2021. 493\u2013496."},{"issue":"4","key":"e_1_3_1_33_2","first-page":"28","article-title":"Apache Flink\u2122: Stream and batch processing in a single engine","volume":"38","year":"2015","unstructured":"Paris Carbone, Asterios Katsifodimos, Stephan Ewen, Volker Markl, Seif Haridi, and Kostas Tzoumas. 2015. Apache Flink\u2122: Stream and batch processing in a single engine. IEEE Data Eng. Bull. 38, 4 (2015), 28\u201338.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0324-8"},{"key":"e_1_3_1_35_2","first-page":"474","volume-title":"PODC 2020","year":"2020","unstructured":"Keren Censor-Hillel, Fran\u00e7ois Le Gall, and Dean Leitersdorf. 2020. On distributed listing of cliques. In PODC 2020. 474\u2013482."},{"key":"e_1_3_1_36_2","first-page":"271","volume-title":"PODC 2022","year":"2022","unstructured":"Keren Censor-Hillel, Dean Leitersdorf, and David Vulakh. 2022. Deterministic near-optimal distributed listing of cliques. In PODC 2022. 271\u2013280."},{"key":"e_1_3_1_37_2","first-page":"2031","article-title":"Scalable single source shortest path algorithms for massively parallel systems","year":"2017","unstructured":"Venkatesan T. Chakaravarthy, Fabio Checconi, Prakash Murali, Fabrizio Petrini, and Yogish Sabharwal. 2017. Scalable single source shortest path algorithms for massively parallel systems. IEEE Trans. Parallel Distributed Syst. 28, 7 (2017), 2031\u20132045.","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2020.08.010"},{"issue":"3","key":"e_1_3_1_39_2","first-page":"21:1\u201321:36","article-title":"Near-optimal distributed triangle enumeration via expander decompositions","volume":"68","year":"2021","unstructured":"Yi-Jun Chang, Seth Pettie, Thatchaphol Saranurak, and Hengjie Zhang. 2021. Near-optimal distributed triangle enumeration via expander decompositions. J. ACM 68, 3 (2021), 21:1\u201321:36.","journal-title":"J. ACM"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331618"},{"key":"e_1_3_1_41_2","first-page":"2","volume-title":"PGAS 2010","year":"2010","unstructured":"Barbara M. Chapman, Tony Curtis, Swaroop Pophale, Stephen W. Poole, Jeffery A. Kuehn, Chuck Koelbel, and Lauren Smith. 2010. Introducing OpenSHMEM: SHMEM for the PGAS community. In PGAS 2010. ACM, 2."},{"key":"e_1_3_1_42_2","first-page":"519","volume-title":"OOPSLA 2005","year":"2005","unstructured":"Philippe Charles, Christian Grothoff, Vijay A. Saraswat, Christopher Donawa, Allan Kielstra, Kemal Ebcioglu, Christoph von Praun, and Vivek Sarkar. 2005. X10: An object-oriented approach to non-uniform cluster computing. In OOPSLA 2005. ACM, 519\u2013538."},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.49"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-021-00412-8"},{"key":"e_1_3_1_45_2","first-page":"32:1\u201332:12","volume-title":"EuroSys 2018","year":"2018","unstructured":"Hongzhi Chen, Miao Liu, Yunjian Zhao, Xiao Yan, Da Yan, and James Cheng. 2018. G-Miner: An efficient task-oriented graph mining system. In EuroSys 2018. 32:1\u201332:12."},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS51556.2021.9401117"},{"key":"e_1_3_1_47_2","doi-asserted-by":"crossref","unstructured":"Jie Chen and Xiang Li. 2023. Toward the minimum vertex cover of complex networks using distributed potential games. Sci. China Inf. Sci. 66 1 (2023) 112205.","DOI":"10.1007\/s11432-021-3291-3"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575743"},{"key":"e_1_3_1_49_2","first-page":"471","volume-title":"IEEE BigData 2014","year":"2014","unstructured":"Pei-Ling Chen, Chung-Kuang Chou, and Ming-Syan Chen. 2014. Distributed algorithms for k-truss decomposition. In IEEE BigData 2014. 471\u2013480."},{"key":"e_1_3_1_50_2","first-page":"581","volume-title":"ISCA 2021","year":"2021","unstructured":"Xuhao Chen, Tianhao Huang, Shuotao Xu, Thomas Bourgeat, Chanwoo Chung, and Arvind. 2021. FlexMiner: A pattern-aware accelerator for graph pattern mining. In ISCA 2021. 581\u2013594."},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"issue":"2","key":"e_1_3_1_52_2","first-page":"81","article-title":"Scaling up a distributed computing of similarity coefficient with MapReduce","volume":"12","year":"2015","unstructured":"Mirel Cosulschi, Mihai Gabroveanu, Florin Slabu, and Adriana Sbircea. 2015. Scaling up a distributed computing of similarity coefficient with MapReduce. Int. J. Comput. Sci. Appl. 12, 2 (2015), 81\u201398.","journal-title":"Int. J. Comput. Sci. Appl."},{"key":"e_1_3_1_53_2","first-page":"337","volume-title":"INFOCOM 2020","year":"2020","unstructured":"Pierluigi Crescenzi, Pierre Fraigniaud, and Ami Paz. 2020. Simple and fast distributed computation of betweenness centrality. In INFOCOM 2020. 337\u2013346."},{"key":"e_1_3_1_54_2","first-page":"4176794:1\u201341767","article-title":"Survey of methodologies, approaches, and challenges in parallel programming using high-performance computing systems","volume":"2020","year":"2020","unstructured":"Pawel Czarnul, Jerzy Proficz, and Krzysztof Drypczewski. 2020. Survey of methodologies, approaches, and challenges in parallel programming using high-performance computing systems. Sci. Program. 2020 (2020), 4176794:1\u20134176794:19.","journal-title":"Sci. Program."},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2821565"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-022-00426-w"},{"key":"e_1_3_1_57_2","first-page":"137","volume-title":"OSDI 2004","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified data processing on large clusters. In OSDI 2004. 137\u2013150."},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.06.003"},{"key":"e_1_3_1_59_2","series-title":"Lecture Notes in Computer Science","first-page":"25","volume-title":"TPCTC 2010","year":"2010","unstructured":"David Dominguez-Sal, Norbert Mart\u00ednez-Bazan, Victor Munt\u00e9s-Mulero, Pere Baleta, and Josep Llu\u00eds Larriba-Pey. 2010. A discussion on the design of graph database benchmarks. In TPCTC 2010(Lecture Notes in Computer Science, Vol. 6417). Springer, 25\u201340."},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.12.023"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/3387161"},{"key":"e_1_3_1_62_2","first-page":"18:1\u201318:10","volume-title":"ICDCN 2015","year":"2015","unstructured":"Guy Even, Moti Medina, and Dana Ron. 2015. Distributed maximum matching in bounded degree graphs. In ICDCN 2015. 18:1\u201318:10."},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476369"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-018-7232-6"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00071"},{"key":"e_1_3_1_66_2","doi-asserted-by":"crossref","unstructured":"C\u00e9dric Fournet Fabrice Le Fessant Luc Maranget and Alan Schmitt. 2002. JoCaml: A language for concurrent distributed and mobile programming. In International School on Advanced Functional Programming. 129\u2013158.","DOI":"10.1007\/978-3-540-44833-4_5"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087571"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2017-1555"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_1_70_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261118"},{"key":"e_1_3_1_71_2","doi-asserted-by":"publisher","DOI":"10.1137\/17M113277X"},{"key":"e_1_3_1_72_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926376"},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286167"},{"key":"e_1_3_1_74_2","doi-asserted-by":"crossref","unstructured":"Sayan Ghosh Mahantesh Halappanavar Antonino Tumeo Ananth Kalyanaraman Hao Lu Daniel G. Chavarr\u00eda-Miranda Arif Khan and Assefaw Hadish Gebremedhin. 2018. Distributed Louvain algorithm for graph community detection. In 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201918). 885\u2013895.","DOI":"10.1109\/IPDPS.2018.00098"},{"key":"e_1_3_1_75_2","first-page":"156","volume-title":"SODA 2005","author":"Goldberg Andrew V.","year":"2005","unstructured":"Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In SODA 2005. 156\u2013165."},{"key":"e_1_3_1_76_2","first-page":"17","volume-title":"OSDI 2012","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 2012. 17\u201330."},{"key":"e_1_3_1_77_2","first-page":"599","volume-title":"OSDI 2014","year":"2014","unstructured":"Joseph E. Gonzalez, Reynold S. Xin, Ankur Dave, Daniel Crankshaw, Michael J. Franklin, and Ion Stoica. 2014. GraphX: Graph processing in a distributed dataflow framework. In OSDI 2014. 599\u2013613."},{"key":"e_1_3_1_78_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45307-5_8"},{"key":"e_1_3_1_79_2","first-page":"479","volume-title":"SIGMOD 2017","year":"2017","unstructured":"Tao Guo, Xin Cao, Gao Cong, Jiaheng Lu, and Xuemin Lin. 2017. Distributed algorithms on exact personalized PageRank. In SIGMOD 2017. 479\u2013494."},{"key":"e_1_3_1_80_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i5.25761"},{"key":"e_1_3_1_81_2","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_3_1_82_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413643"},{"issue":"3","key":"e_1_3_1_83_2","first-page":"60:1\u201360:53","article-title":"Scalable graph processing frameworks: A taxonomy and open challenges","volume":"51","year":"2018","unstructured":"Safiollah Heidari, Yogesh Simmhan, Rodrigo N. Calheiros, and Rajkumar Buyya. 2018. Scalable graph processing frameworks: A taxonomy and open challenges. ACM Comput. Surv. 51, 3 (2018), 60:1\u201360:53.","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_1_84_2","doi-asserted-by":"crossref","unstructured":"Monika Henzinger Sebastian Krinninger and Danupon Nanongkai. 2016. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. (2016) 489\u2013498.","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_1_85_2","first-page":"1","volume-title":"HPEC 2019","year":"2019","unstructured":"Loc Hoang, Vishwesh Jatala, Xuhao Chen, Udit Agarwal, Roshan Dathathri, Gurbinder Gill, and Keshav Pingali. 2019. DistTC: High performance distributed triangle counting. In HPEC 2019. 1\u20137."},{"key":"e_1_3_1_86_2","first-page":"272","volume-title":"PPoPP 2019","year":"2019","unstructured":"Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, Gurbinder Gill, Bozhi You, Keshav Pingali, and Vijaya Ramachandran. 2019. A round-efficient distributed betweenness centrality algorithm. In PPoPP 2019. 272\u2013286."},{"key":"e_1_3_1_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"e_1_3_1_88_2","doi-asserted-by":"crossref","unstructured":"Qiang-Sheng Hua Haoqiang Fan Ming Ai Lixiang Qian Yangyang Li Xuanhua Shi and Hai Jin. 2016. Nearly optimal distributed algorithm for computing betweenness centrality. In 36th IEEE International Conference on Distributed Computing Systems (ICDCS\u201916). 271\u2013280.","DOI":"10.1109\/ICDCS.2016.89"},{"key":"e_1_3_1_89_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2672739"},{"key":"e_1_3_1_90_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2763951"},{"key":"e_1_3_1_91_2","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_1_92_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2407900"},{"key":"e_1_3_1_93_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2417861"},{"key":"e_1_3_1_94_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2762294"},{"key":"e_1_3_1_95_2","unstructured":"George Karypis and Vipin Kumar. 1998. A software package for partitioning unstructured graphs partitioning meshes and computing fill-reducing orderings of sparse matrices. University of Minnesota Department of Computer Science and Engineering Army HPC Research Center Minneapolis MN 38 (1998) 7\u20131."},{"key":"e_1_3_1_96_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_1_97_2","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"e_1_3_1_98_2","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339494"},{"key":"e_1_3_1_99_2","first-page":"53","volume-title":"USENIX ATC 2023","year":"2023","unstructured":"Longbin Lai, Yufan Yang, Zhibin Wang, Yuxuan Liu, Haotian Ma, Sijie Shen, Bingqing Lyu, Xiaoli Zhou, Wenyuan Yu, Zhengping Qian, Chen Tian, Sheng Zhong, Yeh-Ching Chung, and Jingren Zhou. 2023. GLogS: Interactive graph pattern matching query at large scale. In USENIX ATC 2023. USENIX Association, 53\u201369."},{"key":"e_1_3_1_100_2","first-page":"427","volume-title":"USENIX ATC 2018","year":"2018","unstructured":"Kartik Lakhotia, Rajgopal Kannan, and Viktor K. Prasanna. 2018. Accelerating PageRank using partition-centric processing. In USENIX ATC 2018. 427\u2013440."},{"key":"e_1_3_1_101_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00037"},{"key":"e_1_3_1_102_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0326-6"},{"key":"e_1_3_1_103_2","first-page":"232","volume-title":"ICDE 2023","year":"2023","unstructured":"Xue Li, Ke Meng, Lu Qin, Longbin Lai, Wenyuan Yu, Zhengping Qian, Xuemin Lin, and Jingren Zhou. 2023. Flash: A framework for programming distributed graph processing algorithms. In ICDE 2023. IEEE, 232\u2013244."},{"key":"e_1_3_1_104_2","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850472"},{"key":"e_1_3_1_105_2","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529340"},{"key":"e_1_3_1_106_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313555"},{"key":"e_1_3_1_107_2","first-page":"909","volume-title":"ICDE 2023","year":"2023","unstructured":"Qing Liu, Xuankun Liao, Xin Huang, Jianliang Xu, and Yunjun Gao. 2023. Distributed ( \\(\\alpha\\) , \\(\\beta\\) )-core decomposition over bipartite graphs. In ICDE 2023. 909\u2013921."},{"key":"e_1_3_1_108_2","first-page":"1","volume-title":"HPEC 2019","year":"2019","unstructured":"Xu Liu, Jesun Sahariar Firoz, Marcin Zalewski, Mahantesh Halappanavar, Kevin J. Barker, Andrew Lumsdaine, and Assefaw H. Gebremedhin. 2019. Distributed direction-optimizing label propagation for community detection. In HPEC 2019. 1\u20136."},{"key":"e_1_3_1_109_2","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_1_110_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2591038"},{"key":"e_1_3_1_111_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014496"},{"key":"e_1_3_1_112_2","series-title":"Proceedings of Machine Learning Research","first-page":"6459","volume-title":"ICML 2020","volume":"119","author":"Luo Siqiang","year":"2020","unstructured":"Siqiang Luo. 2020. Improved communication cost in distributed PageRank computation - A theoretical study. In ICML 2020(Proceedings of Machine Learning Research, Vol. 119). 6459\u20136467."},{"key":"e_1_3_1_113_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.05.108"},{"key":"e_1_3_1_114_2","unstructured":"Siqiang Luo and Zulun Zhu. 2023. Massively parallel single-source SimRanks in o(log n) rounds. arXiv:2304.04015. Retrieved from https:\/\/arxiv.org\/abs\/2304.04015"},{"key":"e_1_3_1_115_2","first-page":"325","volume-title":"ICDE 2017","year":"2017","unstructured":"Xiongcai Luo, Jun Gao, Chang Zhou, and Jeffrey Xu Yu. 2017. UniWalk: Unidirectional random walk based scalable SimRank computation over large graph. In ICDE 2017. 325\u2013336."},{"key":"e_1_3_1_116_2","doi-asserted-by":"crossref","unstructured":"Tinghuai Ma Mingliang Yue Jingjing Qu Yuan Tian Abdullah Al-Dhelaan and Mznah Al-Rodhaan. 2018. PSPLPA: Probability and similarity based parallel label propagation algorithm on spark. Physica A: Statistical Mechanics and its Applications 503 (2018) 366\u2013378.","DOI":"10.1016\/j.physa.2018.02.130"},{"key":"e_1_3_1_117_2","first-page":"39:1\u201339:2","volume-title":"PPoPP 2016","year":"2016","unstructured":"Saeed Maleki, Donald Nguyen, Andrew Lenharth, Mar\u00eda Jes\u00fas Garzar\u00e1n, David A. Padua, and Keshav Pingali. 2016. DSMR: A shared and distributed memory algorithm for single-source shortest path problem. In PPoPP 2016. 39:1\u201339:2."},{"key":"e_1_3_1_118_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_1_119_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_3_1_120_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258018"},{"key":"e_1_3_1_121_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-020-00387-y"},{"key":"e_1_3_1_122_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.09.003"},{"key":"e_1_3_1_123_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.124"},{"key":"e_1_3_1_124_2","first-page":"561","volume-title":"OSDI 2018","year":"2018","unstructured":"Philipp Moritz, Robert Nishihara, Stephanie Wang, Alexey Tumanov, Richard Liaw, Eric Liang, Melih Elibol, Zongheng Yang, William Paul, Michael I. Jordan, and Ion Stoica. 2018. Ray: A distributed framework for emerging AI applications. In OSDI 2018. USENIX Association, 561\u2013577."},{"key":"e_1_3_1_125_2","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"e_1_3_1_126_2","unstructured":"Oracle. 2014. Remote Method Invocation Home. Retrieved January 15 2024 from https:\/\/www.oracle.com"},{"key":"e_1_3_1_127_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3064892"},{"key":"e_1_3_1_128_2","first-page":"549","volume-title":"SC 2014","year":"2014","unstructured":"Roger A. Pearce, Maya B. Gokhale, and Nancy M. Amato. 2014. Faster parallel traversal of scale free graphs at extreme scale with vertex delegates. In SC 2014. IEEE Computer Society, 549\u2013559."},{"key":"e_1_3_1_129_2","first-page":"97","volume-title":"ICDE 2016","year":"2016","unstructured":"Yun Peng, Byron Choi, Bingsheng He, Shuigeng Zhou, Ruzhi Xu, and Xiaohui Yu. 2016. VColor: A practical vertex-cut based approach for coloring large graphs. In ICDE 2016. 97\u2013108."},{"key":"e_1_3_1_130_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.07.003"},{"key":"e_1_3_1_131_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_3_1_132_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3209446"},{"key":"e_1_3_1_133_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.11.003"},{"key":"e_1_3_1_134_2","first-page":"472","volume-title":"SOSP 2013","year":"2013","unstructured":"Amitabha Roy, Ivo Mihailovic, and Willy Zwaenepoel. 2013. X-Stream: Edge-centric graph processing using streaming partitions. In SOSP 2013. 472\u2013488."},{"key":"e_1_3_1_135_2","first-page":"478","volume-title":"STOC 2022","year":"2022","unstructured":"V\u00e1clav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, and Jason Li. 2022. Undirected (1+ \\(\\epsilon\\) )-shortest paths via minor-aggregates: Near-optimal deterministic parallel and distributed algorithms. In STOC 2022. 478\u2013487."},{"issue":"1","key":"e_1_3_1_136_2","first-page":"11:1\u201311:44","article-title":"The family of MapReduce and large-scale data processing systems","volume":"46","year":"2013","unstructured":"Sherif Sakr, Anna Liu, and Ayman G. Fayoumi. 2013. The family of MapReduce and large-scale data processing systems. ACM Comput. Surv. 46, 1 (2013), 11:1\u201311:44.","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_1_137_2","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_1_138_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00076"},{"key":"e_1_3_1_139_2","first-page":"1","volume-title":"CLUSTER 2013","year":"2013","unstructured":"Ahmet Erdem Sariy\u00fcce, Erik Saule, Kamer Kaya, and \u00dcmit V. \u00c7ataly\u00fcrek. 2013. STREAMER: A distributed framework for incremental closeness centrality computation. In CLUSTER 2013. 1\u20138."},{"key":"e_1_3_1_140_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.04.003"},{"key":"e_1_3_1_141_2","doi-asserted-by":"publisher","DOI":"10.1109\/DASC\/PiCom\/DataCom\/CyberSciTec.2018.00122"},{"key":"e_1_3_1_142_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-04224-2"},{"issue":"3","key":"e_1_3_1_143_2","first-page":"964","article-title":"Efficient distributed k-Clique mining for large networks using MapReduce","volume":"33","author":"Shahrivari Saeed","year":"2021","unstructured":"Saeed Shahrivari and Saeed Jalili. 2021. Efficient distributed k-Clique mining for large networks using MapReduce. IEEE Trans. Knowl. Data Eng. 33, 3 (2021), 964\u2013974.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_1_144_2","first-page":"613","volume-title":"SIGMOD 2014","year":"2014","unstructured":"Yingxia Shao, Lei Chen, and Bin Cui. 2014. Efficient cohesive subgraphs detection in parallel. In SIGMOD 2014. 613\u2013624."},{"key":"e_1_3_1_145_2","first-page":"431","volume-title":"WWW 2017","year":"2017","unstructured":"Aneesh Sharma, C. Seshadhri, and Ashish Goel. 2017. When hashes met wedges: A distributed algorithm for finding high similarity vectors. In WWW 2017. ACM, 431\u2013440."},{"key":"e_1_3_1_146_2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2012.111412.00045"},{"key":"e_1_3_1_147_2","series-title":"Lecture Notes in Computer Science","first-page":"451","volume-title":"Euro-Par 2014","year":"2014","unstructured":"Yogesh Simmhan, Alok Gautam Kumbhare, Charith Wickramaarachchi, Soonil Nagarkar, Santosh Ravi, Cauligi S. Raghavendra, and Viktor K. Prasanna. 2014. GoFFish: A sub-graph centric framework for large-scale graph analytics. In Euro-Par 2014(Lecture Notes in Computer Science, Vol. 8632). 451\u2013462."},{"key":"e_1_3_1_148_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01328-3"},{"key":"e_1_3_1_149_2","first-page":"67","volume-title":"SC 2021","year":"2021","unstructured":"Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, and Roger Pearce. 2021. TriPoll: Computing surveys of triangles in massive-scale temporal graphs with metadata. In SC 2021. ACM, 67."},{"key":"e_1_3_1_150_2","first-page":"291","volume-title":"IPDPS 2022","year":"2022","unstructured":"Andr\u00e1s Strausz, Flavio Vella, Salvatore Di Girolamo, Maciej Besta, and Torsten Hoefler. 2022. Asynchronous distributed-memory triangle counting and LCC with RMA caching. In IPDPS 2022. 291\u2013301."},{"key":"e_1_3_1_151_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2021.3121695"},{"key":"e_1_3_1_152_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.08.011"},{"key":"e_1_3_1_153_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0466-x"},{"key":"e_1_3_1_154_2","first-page":"425","volume-title":"SOSP 2015","year":"2015","unstructured":"Carlos H. C. Teixeira, Alexandre J. Fonseca, Marco Serafini, Georgos Siganos, Mohammed J. Zaki, and Ashraf Aboulnaga. 2015. Arabesque: A system for distributed graph mining. In SOSP 2015. 425\u2013440."},{"key":"e_1_3_1_155_2","first-page":"878","volume-title":"Proceedings of SC","year":"1993","unstructured":"CORPORATE The MPI Forum. 1993. MPI: A message passing interface. In Proceedings of SC. 878\u2013883."},{"key":"e_1_3_1_156_2","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_3_1_157_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27798-9_19"},{"key":"e_1_3_1_158_2","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2595641"},{"issue":"4","key":"e_1_3_1_159_2","first-page":"469","article-title":"Parallel and distributed Haskells","volume":"12","year":"2002","unstructured":"Philip W. Trinder, Hans-Wolfgang Loidl, and Robert F. Pointon. 2002. Parallel and distributed Haskells. J. Funct. Program. 12, 4&5 (2002), 469\u2013510.","journal-title":"J. Funct. Program."},{"key":"e_1_3_1_160_2","first-page":"172","volume-title":"ISM 2020","author":"Wallmann Christian","year":"2020","unstructured":"Christian Wallmann and Markus Gerschberger. 2020. The association between network centrality measures and supply chain performance: The case of distribution networks. In ISM 2020, Vol. 180. Elsevier, 172\u2013179."},{"key":"e_1_3_1_161_2","first-page":"19:1\u201319:15","volume-title":"SC 2022","year":"2022","unstructured":"Yuanwei Wang, Huanqi Cao, Zixuan Ma, Wanwang Yin, and Wenguang Chen. 2022. Scaling graph 500 SSSP to 140 Trillion edges with over 40 Million Cores. In SC 2022. 19:1\u201319:15."},{"key":"e_1_3_1_162_2","doi-asserted-by":"publisher","DOI":"10.14778\/3430915.3430925"},{"key":"e_1_3_1_163_2","first-page":"136","volume-title":"ICDE 2019","year":"2019","unstructured":"Zhaokang Wang, Rong Gu, Weiwei Hu, Chunfeng Yuan, and Yihua Huang. 2019. BENU: Distributed subgraph enumeration with backtracking-based framework. In ICDE 2019. 136\u2013147."},{"key":"e_1_3_1_164_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.05.001"},{"key":"e_1_3_1_165_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3090759"},{"key":"e_1_3_1_166_2","volume-title":"Hadoop: The Definitive Guide","author":"White Tom","year":"2012","unstructured":"Tom White. 2012. Hadoop: The Definitive Guide. O\u2019Reilly Media, Inc."},{"key":"e_1_3_1_167_2","first-page":"69","volume-title":"SC 2021","year":"2021","unstructured":"Lizhi Xiang, Arif Khan, Edoardo Serra, Mahantesh Halappanavar, and Aravind Sukumaran-Rajam. 2021. cuTS: Scaling subgraph isomorphism on distributed multi-GPU systems using trie based data structure. In SC 2021. 69."},{"key":"e_1_3_1_168_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2479225"},{"key":"e_1_3_1_169_2","first-page":"160","volume-title":"IEEE BigData 2014","year":"2014","unstructured":"Yanyan Xu, James Cheng, Ada Wai-Chee Fu, and Yingyi Bu. 2014. Distributed maximal clique computation. In IEEE BigData 2014. 160\u2013167."},{"key":"e_1_3_1_170_2","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_3_1_171_2","first-page":"1307","volume-title":"WWW 2015","year":"2015","unstructured":"Da Yan, James Cheng, Yi Lu, and Wilfred Ng. 2015. Effective techniques for message reduction and load balancing in distributed graph computation. In WWW 2015. 1307\u20131317."},{"key":"e_1_3_1_172_2","first-page":"2049","volume-title":"SIGMOD 2021","year":"2021","unstructured":"Zhengyi Yang, Longbin Lai, Xuemin Lin, Kongzhang Hao, and Wenjie Zhang. 2021. HUGE: An efficient and scalable subgraph enumeration system. In SIGMOD 2021. 2049\u20132062."},{"key":"e_1_3_1_173_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3093240"},{"key":"e_1_3_1_174_2","first-page":"665","volume-title":"SIGMOD 2020","year":"2020","unstructured":"Ziqiang Yu, Xiaohui Yu, Nick Koudas, Yang Liu, Yifan Li, Yueting Chen, and Dingyu Yang. 2020. Distributed processing of k shortest path queries over dynamic road networks. In SIGMOD 2020. 665\u2013679."},{"key":"e_1_3_1_175_2","first-page":"15","volume-title":"NSDI 2012","year":"2012","unstructured":"Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy McCauly, Michael J. Franklin, Scott Shenker, and Ion Stoica. 2012. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI 2012. 15\u201328."},{"key":"e_1_3_1_176_2","volume-title":"HotCloud 2010","year":"2010","unstructured":"Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin, Scott Shenker, and Ion Stoica. 2010. Spark: Cluster computing with working sets. In HotCloud 2010."},{"key":"e_1_3_1_177_2","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"},{"key":"e_1_3_1_178_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2018.00044"},{"key":"e_1_3_1_179_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0457-6"},{"key":"e_1_3_1_180_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3059420"},{"key":"e_1_3_1_181_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.09.052"},{"key":"e_1_3_1_182_2","first-page":"2549","volume-title":"SODA 2022","year":"2022","unstructured":"Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, and Xiaorui Sun. 2022. Universally-optimal distributed shortest paths and transshipment via graph-based \\(\\ell {}_{\\mbox{1}}\\) -oblivious routing. In SODA 2022. 2549\u20132579."}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694966","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:07Z","timestamp":1750295887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,10]]},"references-count":181,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2,28]]}},"alternative-id":["10.1145\/3694966"],"URL":"https:\/\/doi.org\/10.1145\/3694966","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,10]]},"assertion":[{"value":"2024-02-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-22","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}