{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:42Z","timestamp":1773481842934,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":71,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100004944","name":"Department of Energy, Labor and Economic Growth","doi-asserted-by":"publisher","award":["DE-SC0018947"],"award-info":[{"award-number":["DE-SC0018947"]}],"id":[{"id":"10.13039\/100004944","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1845763"],"award-info":[{"award-number":["CCF-1845763"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Google Faculty Research Award"],"award-info":[{"award-number":["Google Faculty Research Award"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR0011-18-3-0007"],"award-info":[{"award-number":["HR0011-18-3-0007"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,11]]},"DOI":"10.1145\/3490148.3538569","type":"proceedings-article","created":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T22:10:15Z","timestamp":1657491015000},"page":"191-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems"],"prefix":"10.1145","author":[{"given":"Quanquan C.","family":"Liu","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}]},{"given":"Jessica","family":"Shi","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]},{"given":"Shangdi","family":"Yu","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]},{"given":"Laxman","family":"Dhulipala","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Julian","family":"Shun","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"International Conference on Neural Information Processing Systems.","author":"Alvarez-Hamelin J. Ignacio","year":"2005","unstructured":"J. Ignacio Alvarez-Hamelin , Luca Dall'Asta , Alain Barrat , and Alessandro Vespignani . 2005 . Large Scale Networks Fingerprinting and Visualization Using the k-Core Decomposition . In International Conference on Neural Information Processing Systems. J. Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2005. Large Scale Networks Fingerprinting and Visualization Using the k-Core Decomposition. In International Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_2_1","volume-title":"Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC bioinformatics 7 (02","author":"Amin Altaf","year":"2006","unstructured":"Altaf Amin , Yoko Shinbo , Kenji Mihara , Ken Kurokawa , and Shigehiko Kanaya . 2006. Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC bioinformatics 7 (02 2006 ), 207. Altaf Amin, Yoko Shinbo, Kenji Mihara, Ken Kurokawa, and Shigehiko Kanaya. 2006. Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC bioinformatics 7 (02 2006), 207."},{"key":"e_1_3_2_1_4_1","volume-title":"Distributed -Core Decomposition and Maintenance in Large Dynamic Graphs. In ACM International Conference on Distributed and Event-Based Systems. 161--168","author":"Aridhi Sabeur","year":"2016","unstructured":"Sabeur Aridhi , Martin Brugnara , Alberto Montresor , and Yannis Velegrakis . 2016 . Distributed -Core Decomposition and Maintenance in Large Dynamic Graphs. In ACM International Conference on Distributed and Event-Based Systems. 161--168 . Sabeur Aridhi, Martin Brugnara, Alberto Montresor, and Yannis Velegrakis. 2016. Distributed -Core Decomposition and Maintenance in Large Dynamic Graphs. In ACM International Conference on Distributed and Event-Based Systems. 161--168."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-4-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0528-0"},{"key":"e_1_3_2_1_7_1","volume-title":"Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. In ACM Symposium on Theory of Computing (STOC). 173--182","author":"Bhattacharya Sayan","year":"2015","unstructured":"Sayan Bhattacharya , Monika Henzinger , Danupon Nanongkai , and Charalampos Tsourakakis . 2015 . Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. In ACM Symposium on Theory of Computing (STOC). 173--182 . Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos Tsourakakis. 2015. Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. In ACM Symposium on Theory of Computing (STOC). 173--182."},{"key":"e_1_3_2_1_8_1","volume-title":"ACM Symp. on Parallel Alg. (SPAA).","author":"Blelloch Guy E.","year":"2020","unstructured":"Guy E. Blelloch , Daniel Anderson , and Laxman Dhulipala . 2020 . Brief Announcement: ParlayLib -- A Toolkit for Parallel Algorithms on Shared-MemoryMulticore Machines . In ACM Symp. on Parallel Alg. (SPAA). Guy E. Blelloch, Daniel Anderson, and Laxman Dhulipala. 2020. Brief Announcement: ParlayLib -- A Toolkit for Parallel Algorithms on Shared-MemoryMulticore Machines. In ACM Symp. on Parallel Alg. (SPAA)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Francesco Bonchi Francesco Gullo Andreas Kaltenbrunner and Yana Volkovich. 2014. Core Decomposition of Uncertain Graphs. In ACM SIGKDD. 1316--1325. Francesco Bonchi Francesco Gullo Andreas Kaltenbrunner and Yana Volkovich. 2014. Core Decomposition of Uncertain Graphs. In ACM SIGKDD. 1316--1325.","DOI":"10.1145\/2623330.2623655"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645932.673191"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0701175104"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2020.08.010"},{"key":"e_1_3_2_1_14_1","volume-title":"Finding the Best in Core Decomposition: A Time and Space Optimal Solution","author":"Chu Deming","unstructured":"Deming Chu , Fan Zhang , Xuemin Lin , Wenjie Zhang , Ying Zhang , Yinglong Xia , and Chenyi Zhang . 2020. Finding the Best in Core Decomposition: A Time and Space Optimal Solution . In IEEE ICDE. 685--696. Deming Chu, Fan Zhang, Xuemin Lin, Wenjie Zhang, Ying Zhang, Yinglong Xia, and Chenyi Zhang. 2020. Finding the Best in Core Decomposition: A Time and Space Optimal Solution. In IEEE ICDE. 685--696."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-69464-3"},{"key":"e_1_3_2_1_16_1","volume-title":"Introduction to Algorithms (3. ed.)","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms (3. ed.) . MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3. ed.). MIT Press."},{"key":"e_1_3_2_1_17_1","volume-title":"Johnson","author":"Demetrescu Camil","year":"2008","unstructured":"Camil Demetrescu , Andrew V. Goldberg , and David S . Johnson . 2008 . Implementation Challenge for Shortest Paths . 395--398. Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson. 2008. Implementation Challenge for Shortest Paths. 395--398."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_19_1","volume-title":"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).","author":"Dhulipala Laxman","year":"2018","unstructured":"Laxman Dhulipala , Guy E. Blelloch , and Julian Shun . 2018 . Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Laxman Dhulipala, Guy E. Blelloch, and Julian Shun. 2018. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.10"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1513876.1513879"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40104-6_27"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Extending Database Technology. 325--336","author":"Esfahani Fatemeh","year":"2019","unstructured":"Fatemeh Esfahani , Venkatesh Srinivasan , Alex Thomo , and KuiWu. 2019 . Efficient Computation of Probabilistic Core Decomposition at Web-Scale . In International Conference on Extending Database Technology. 325--336 . Fatemeh Esfahani, Venkatesh Srinivasan, Alex Thomo, and KuiWu. 2019. Efficient Computation of Probabilistic Core Decomposition at Web-Scale. In International Conference on Extending Database Technology. 325--336."},{"key":"e_1_3_2_1_24_1","volume-title":"Parallel and Streaming Algorithms for -Core Decomposition. In International Conference on Machine Learning. 1397--1406","author":"Esfandiari Hossein","year":"2018","unstructured":"Hossein Esfandiari , Silvio Lattanzi , and Vahab Mirrokni . 2018 . Parallel and Streaming Algorithms for -Core Decomposition. In International Conference on Machine Learning. 1397--1406 . Hossein Esfandiari, Silvio Lattanzi, and Vahab Mirrokni. 2018. Parallel and Streaming Algorithms for -Core Decomposition. In International Conference on Machine Learning. 1397--1406."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055337"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW52791.2021.00158"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3369872"},{"key":"e_1_3_2_1_28_1","volume-title":"Improved Parallel Algorithms for Density-Based Network Clustering. In International Conference on Machine Learning. 2201--2210","author":"Ghaffari Mohsen","year":"2019","unstructured":"Mohsen Ghaffari , Silvio Lattanzi , and Slobodan Mitrovic . 2019 . Improved Parallel Algorithms for Density-Based Network Clustering. In International Conference on Machine Learning. 2201--2210 . Mohsen Ghaffari, Silvio Lattanzi, and Slobodan Mitrovic. 2019. Improved Parallel Algorithms for Density-Based Network Clustering. In International Conference on Machine Learning. 2201--2210."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Christos Giatsidis Fragkiskos D. Malliaros Dimitrios M. Thilikos and Michalis Vazirgiannis. 2014. CoreCluster: A Degeneracy Based Graph Clustering Framework. In AAAI. 44--50. Christos Giatsidis Fragkiskos D. Malliaros Dimitrios M. Thilikos and Michalis Vazirgiannis. 2014. CoreCluster: A Degeneracy Based Graph Clustering Framework. In AAAI. 44--50.","DOI":"10.1609\/aaai.v28i1.8731"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"J. Gil Y. Matias and U. Vishkin. 1991. Towards a theory of nearly constant time parallel algorithms. In IEEE FOCS. 698--710. J. Gil Y. Matias and U. Vishkin. 1991. Towards a theory of nearly constant time parallel algorithms. In IEEE FOCS. 698--710.","DOI":"10.1109\/SFCS.1991.185438"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13075-0_11"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"John Healy Jeannette Janssen Evangelos Milios and William Aiello. 2007. Characterization of Graphs Using Degree Cores. In InternationalWorkshop on Algorithms and Models for the Web-Graph (WAW). 137--148. John Healy Jeannette Janssen Evangelos Milios and William Aiello. 2007. Characterization of Graphs Using Degree Cores. In InternationalWorkshop on Algorithms and Models for the Web-Graph (WAW). 137--148.","DOI":"10.1007\/978-3-540-78808-9_13"},{"key":"e_1_3_2_1_33_1","volume-title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. CoRR abs\/2002.10142","author":"Henzinger Monika","year":"2020","unstructured":"Monika Henzinger , Stefan Neumann , and Andreas Wiese . 2020. Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. CoRR abs\/2002.10142 ( 2020 ). Monika Henzinger, Stefan Neumann, and Andreas Wiese. 2020. Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. CoRR abs\/2002.10142 (2020)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2960226"},{"key":"e_1_3_2_1_35_1","volume-title":"Introduction to Parallel Algorithms","author":"Jaja J.","unstructured":"J. Jaja . 1992. Introduction to Parallel Algorithms . Addison-Wesley Professional . J. Jaja. 1992. Introduction to Parallel Algorithms. Addison-Wesley Professional."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2835441"},{"key":"e_1_3_2_1_37_1","volume-title":"Parallel -Core Decomposition on Multicore Platforms. In IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 1482--1491","author":"Kabir H.","unstructured":"H. Kabir and K. Madduri . 2017 . Parallel -Core Decomposition on Multicore Platforms. In IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 1482--1491 . H. Kabir and K. Madduri. 2017. Parallel -Core Decomposition on Multicore Platforms. In IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 1482--1491."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210397"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Tsvi Kopelowitz Robert Krauthgamer Ely Porat and Shay Solomon. 2014. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. In International Colloquium on Automata Languages and Programming (ICALP). 532--543. Tsvi Kopelowitz Robert Krauthgamer Ely Porat and Shay Solomon. 2014. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. In International Colloquium on Automata Languages and Programming (ICALP). 532--543.","DOI":"10.1007\/978-3-662-43951-7_45"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.12.006"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Victor E. Lee Ning Ruan Ruoming Jin and Charu Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data. 303--336. Victor E. Lee Ning Ruan Ruoming Jin and Charu Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data. 303--336.","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_45_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014). Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368300"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_3_2_1_48_1","unstructured":"Quanquan C. Liu Jessica Shi Shangdi Yu Laxman Dhulipala and Julian Shun. 2022. Parallel Batch-Dynamic Algorithms for -Core Decomposition and Related Graph Problems. https:\/\/arxiv.org\/abs\/2106.03824 Quanquan C. Liu Jessica Shi Shangdi Yu Laxman Dhulipala and Julian Shun. 2022. Parallel Batch-Dynamic Algorithms for -Core Decomposition and Related Graph Problems. https:\/\/arxiv.org\/abs\/2106.03824"},{"key":"e_1_3_2_1_49_1","volume-title":"Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition. Scientific Reports 5 (May","author":"Liu Ying","year":"2015","unstructured":"Ying Liu , Ming Tang , Tao Zhou , and Younghae Do. 2015. Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition. Scientific Reports 5 (May 2015 ), 9602--9602. Ying Liu, Ming Tang, Tao Zhou, and Younghae Do. 2015. Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition. Scientific Reports 5 (May 2015), 9602--9602."},{"key":"e_1_3_2_1_50_1","volume-title":"Hypercore Maintenance in Dynamic Hypergraphs","author":"Luo Qi","year":"2051","unstructured":"Qi Luo , Dongxiao Yu , Zhipeng Cai , Xuemin Lin , and Xiuzhen Cheng . 2021. Hypercore Maintenance in Dynamic Hypergraphs . In IEEE ICDE. 2051 --2056. Qi Luo, Dongxiao Yu, Zhipeng Cai, Xuemin Lin, and Xiuzhen Cheng. 2021. Hypercore Maintenance in Dynamic Hypergraphs. In IEEE ICDE. 2051--2056."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Qi Luo Dongxiao Yu Feng Li Zhenhao Dou Zhipeng Cai Jiguo Yu and Xiuzhen Cheng. 2019. Distributed Core Decomposition in Probabilistic Graphs. In Computational Data and Social Networks. 16--32. Qi Luo Dongxiao Yu Feng Li Zhenhao Dou Zhipeng Cai Jiguo Yu and Xiuzhen Cheng. 2019. Distributed Core Decomposition in Probabilistic Graphs. In Computational Data and Social Networks. 16--32.","DOI":"10.1007\/978-3-030-34980-6_2"},{"key":"e_1_3_2_1_52_1","volume-title":"Locating influential nodes in complex networks. Scientific Reports 6, 1","author":"Malliaros Fragkiskos D.","year":"2016","unstructured":"Fragkiskos D. Malliaros , Maria-Evgenia G. Rossi , and Michalis Vazirgiannis . 2016. Locating influential nodes in complex networks. Scientific Reports 6, 1 ( 2016 ). Fragkiskos D. Malliaros, Maria-Evgenia G. Rossi, and Michalis Vazirgiannis. 2016. Locating influential nodes in complex networks. Scientific Reports 6, 1 (2016)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_54_1","volume-title":"19th International Conference on Autonomous Agents and MultiAgent Systems. 1922--1924","author":"Medya Sourav","year":"2020","unstructured":"Sourav Medya , Tianyi Ma , Arlei Silva , and Ambuj Singh . 2020 . A Game Theoretic Approach For K-Core Minimization . In 19th International Conference on Autonomous Agents and MultiAgent Systems. 1922--1924 . Sourav Medya, Tianyi Ma, Arlei Silva, and Ambuj Singh. 2020. A Game Theoretic Approach For K-Core Minimization. In 19th International Conference on Autonomous Agents and MultiAgent Systems. 1922--1924."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_1_56_1","first-page":"1","article-title":"Simple deterministic algorithms for fully dynamic maximal matching","volume":"12","author":"Neiman Ofer","year":"2015","unstructured":"Ofer Neiman and Shay Solomon . 2015 . Simple deterministic algorithms for fully dynamic maximal matching . ACM Trans. on Alg. (TALG) 12 , 1 (2015), 1 -- 15 . Ofer Neiman and Shay Solomon. 2015. Simple deterministic algorithms for fully dynamic maximal matching. ACM Trans. on Alg. (TALG) 12, 1 (2015), 1--15.","journal-title":"ACM Trans. on Alg. (TALG)"},{"key":"e_1_3_2_1_57_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K . Ahmed . 2015 . The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. 4292--4293. http: \/\/networkrepository.com Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. 4292--4293. http: \/\/networkrepository.com"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0423-8"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"e_1_3_2_1_60_1","volume-title":"Near-Optimal Fully Dynamic Densest Subgraph. In ACM SIGACT Symposium on Theory of Computing. 181--193","author":"Sawlani Saurabh","year":"2020","unstructured":"Saurabh Sawlani and Junxing Wang . 2020 . Near-Optimal Fully Dynamic Densest Subgraph. In ACM SIGACT Symposium on Theory of Computing. 181--193 . Saurabh Sawlani and Junxing Wang. 2020. Near-Optimal Fully Dynamic Densest Subgraph. In ACM SIGACT Symposium on Theory of Computing. 181--193."},{"key":"e_1_3_2_1_61_1","volume-title":"Parallel Clique Counting and Peeling Algorithms. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA). 135--146","author":"Shi Jessica","year":"2021","unstructured":"Jessica Shi , Laxman Dhulipala , and Julian Shun . 2021 . Parallel Clique Counting and Peeling Algorithms. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA). 135--146 . Jessica Shi, Laxman Dhulipala, and Julian Shun. 2021. Parallel Clique Counting and Peeling Algorithms. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA). 135--146."},{"key":"e_1_3_2_1_62_1","article-title":"Improved Dynamic Graph Coloring","volume":"16","author":"Solomon Shay","year":"2020","unstructured":"Shay Solomon and Nicole Wein . 2020 . Improved Dynamic Graph Coloring . ACM Trans. on Alg. (TALG) 16 , 3, Article 41 (June 2020). Shay Solomon and Nicole Wein. 2020. Improved Dynamic Graph Coloring. ACM Trans. on Alg. (TALG) 16, 3, Article 41 (June 2020).","journal-title":"ACM Trans. on Alg. (TALG)"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385416"},{"key":"e_1_3_2_1_64_1","unstructured":"Bintao Sun T-H. Hubert Chan and Mauro Sozio. 2020. Fully Dynamic Approximate -Core Decomposition in Hypergraphs. https:\/\/github.com\/btsun\/ DynHyperCoreDecomp Bintao Sun T-H. Hubert Chan and Mauro Sozio. 2020. Fully Dynamic Approximate -Core Decomposition in Hypergraphs. https:\/\/github.com\/btsun\/ DynHyperCoreDecomp"},{"key":"e_1_3_2_1_65_1","volume-title":"Batch-Parallel Euler Tour Trees. In Workshop on Algorithm Engineering and Experiments (ALENEX). 92--106","author":"Tseng Thomas","unstructured":"Thomas Tseng , Laxman Dhulipala , and Guy E. Blelloch . 2019 . Batch-Parallel Euler Tour Trees. In Workshop on Algorithm Engineering and Experiments (ALENEX). 92--106 . Thomas Tseng, Laxman Dhulipala, and Guy E. Blelloch. 2019. Batch-Parallel Euler Tour Trees. In Workshop on Algorithm Engineering and Experiments (ALENEX). 92--106."},{"key":"e_1_3_2_1_66_1","volume-title":"Efficient Computing of Radius-Bounded k-Cores","author":"Wang Kai","unstructured":"Kai Wang , Xin Cao , Xuemin Lin , Wenjie Zhang , and Lu Qin . 2018. Efficient Computing of Radius-Bounded k-Cores . In IEEE ICDE. 233--244. Kai Wang, Xin Cao, Xuemin Lin, Wenjie Zhang, and Lu Qin. 2018. Efficient Computing of Radius-Bounded k-Cores. In IEEE ICDE. 233--244."},{"key":"e_1_3_2_1_67_1","volume-title":"Parallel Algorithm for Core Maintenance in Dynamic Graphs. In IEEE 37th International Conference on Distributed Computing Systems (ICDCS). 2366--2371","author":"Wang Na","year":"2017","unstructured":"Na Wang , Dongxiao Yu , Hai Jin , Chen Qian , Xia Xie , and Qiang-Sheng Hua . 2017 . Parallel Algorithm for Core Maintenance in Dynamic Graphs. In IEEE 37th International Conference on Distributed Computing Systems (ICDCS). 2366--2371 . Na Wang, Dongxiao Yu, Hai Jin, Chen Qian, Xia Xie, and Qiang-Sheng Hua. 2017. Parallel Algorithm for Core Maintenance in Dynamic Graphs. In IEEE 37th International Conference on Distributed Computing Systems (ICDCS). 2366--2371."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3115404.3115410"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0299-0"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"crossref","unstructured":"Y. Zhang J. Yu Y. Zhang and L. Qin. 2017. A Fast Order-Based Approach for Core Maintenance. In IEEE ICDE. 337--348. Y. Zhang J. Yu Y. Zhang and L. Qin. 2017. A Fast Order-Based Approach for Core Maintenance. In IEEE ICDE. 337--348.","DOI":"10.1109\/ICDE.2017.93"},{"key":"e_1_3_2_1_72_1","volume-title":"Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs. In ACM SIGMOD International Conference on Management of Data. 1024--1041","author":"Zhang Yikai","year":"2019","unstructured":"Yikai Zhang and Jeffrey Xu Yu . 2019 . Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs. In ACM SIGMOD International Conference on Management of Data. 1024--1041 . Yikai Zhang and Jeffrey Xu Yu. 2019. Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs. In ACM SIGMOD International Conference on Management of Data. 1024--1041."}],"event":{"name":"SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Philadelphia PA USA","acronym":"SPAA '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538569","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490148.3538569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:08Z","timestamp":1750191128000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490148.3538569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":71,"alternative-id":["10.1145\/3490148.3538569","10.1145\/3490148"],"URL":"https:\/\/doi.org\/10.1145\/3490148.3538569","relation":{},"subject":[],"published":{"date-parts":[[2022,7,11]]},"assertion":[{"value":"2022-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}