{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T10:29:00Z","timestamp":1786444140284,"version":"build-2736575974"},"reference-count":266,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T00:00:00Z","timestamp":1670889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["101019564"],"award-info":[{"award-number":["101019564"]}]},{"name":"Austrian Science Fund","award":["P\u00a033775-N"],"award-info":[{"award-number":["P\u00a033775-N"]}]},{"name":"netidee SCIENCE Stiftung"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.<\/jats:p>","DOI":"10.1145\/3555806","type":"journal-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T11:30:54Z","timestamp":1660303854000},"page":"1-45","source":"Crossref","is-referenced-by-count":33,"title":["Recent Advances in Fully Dynamic Graph Algorithms \u2013 A Quick Reference Guide"],"prefix":"10.1145","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5945-837X","authenticated-orcid":false,"given":"Kathrin","family":"Hanauer","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5008-6530","authenticated-orcid":false,"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2823-3506","authenticated-orcid":false,"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[{"name":"Heidelberg University, Heidelberg, Baden-W\u00fcrttemberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316376"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.58"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.28"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2014.1"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323196"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2020.2"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137651"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568007"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/264216.264223"},{"key":"e_1_3_2_12_2","first-page":"129","volume-title":"Proceedings of the Workshop on Algorithms and Experiments","author":"Alberts David","year":"1998","unstructured":"David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano, Umberto Nanni, and Christos Zaroliagis. 1998. A software library of dynamic graph algorithms. In Proceedings of the Workshop on Algorithms and Experiments. Citeseer, 129\u2013136."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/320176.320180"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2014.6921567"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2012.257"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.13"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976830.4"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.7"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2933267.2933299"},{"key":"e_1_3_2_20_2","volume-title":"Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks.","author":"Hegde Lavy Libman Ariel Orda and Nidhi","year":"2010","unstructured":"Lavy Libman Ariel Orda and Nidhi Hegde (Ed.). 2010. In Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks.IEEE. Retrieved from https:\/\/ieeexplore.ieee.org\/xpl\/conhome\/5509122\/proceeding."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188922"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.116"},{"key":"e_1_3_2_23_2","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties","author":"Ausiello G.","year":"2012","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. 2012. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer Science & Business Media."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00081"},{"key":"e_1_3_2_25_2","unstructured":"Thomas Aynaud and Jean-Loup Guillaume. 2010. Static community detection algorithms for evolving networks See Ariel Orda [19] 513\u2013519. Retrieved from http:\/\/ieeexplore.ieee.org\/document\/5520221\/."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25501-4_20"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1137\/17M114306X"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/16M1106158"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.MFCS.2019.65"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02011-7_7"},{"key":"e_1_3_2_32_2","volume-title":"Generative Model for Dynamic Networks with Community Structures","author":"Becker F.","year":"2020","unstructured":"F. Becker. 2020. Generative Model for Dynamic Networks with Community Structures. Master\u2019s Thesis. Heidelberg University."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00032"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.152"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.110"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_14"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2016.1177802"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973754.12"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.115"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch50"},{"key":"e_1_3_2_42_2","volume-title":"Proceedings of the ATMOS 2009-9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.","volume":"12","author":"Berrettini Emanuele","year":"2009","unstructured":"Emanuele Berrettini, Gianlorenzo D\u2019Angelo, and Daniel Delling. 2009. Arc-flags in dynamic graphs. In Proceedings of the ATMOS 2009-9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.Jens Clausen and Gabriele Di Stefano (Eds.), Vol. 12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. Retrieved from http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/2149."},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00630-4"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1137\/140998925"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.02.005"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897568"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.54"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00033"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.150"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.113"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2020.19"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.3"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190689"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SEA.2020.26"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0036-4"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1070.0231"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547541"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45643-0_9"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.10.005"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.198"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.33"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00031"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622452"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00109"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2017.09.001"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.3390\/a13090211"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2014.96"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/2786022"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.21542"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299901"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"e_1_3_2_77_2","volume-title":"Fully Dynamic Algorithms for Path Problems on Directed Graphs","author":"Demetrescu Camil","year":"2001","unstructured":"Camil Demetrescu. 2001. Fully Dynamic Algorithms for Path Problems on Directed Graphs. Ph.D. Dissertation. Retrieved from http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.21.8921."},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0"},{"key":"e_1_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44691-5_19"},{"key":"e_1_3_2_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198519"},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976489.10"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1145\/3110025"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22300-6_29"},{"key":"e_1_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_88_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0002"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794269072"},{"key":"e_1_3_2_90_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.11.034"},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00273"},{"key":"e_1_3_2_92_2","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389142"},{"key":"e_1_3_2_93_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363954"},{"key":"e_1_3_2_94_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.75"},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.1137\/0214055"},{"key":"e_1_3_2_96_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792226825"},{"key":"e_1_3_2_97_2","doi-asserted-by":"publisher","DOI":"10.1145\/297096.297147"},{"key":"e_1_3_2_98_2","first-page":"212","volume-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Frigioni Daniele","year":"1996","unstructured":"Daniele Frigioni, Alberto Marchetti-Spaccamela, and Umberto Nanni. 1996. Fully dynamic output bounded single source shortest path problem (extended abstract). In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. \u00c9va Tardos (Ed.). ACM\/SIAM, 212\u2013221. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=313852.313926."},{"key":"e_1_3_2_99_2","doi-asserted-by":"publisher","DOI":"10.1145\/945394.945403"},{"key":"e_1_3_2_100_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12100213"},{"key":"e_1_3_2_101_2","first-page":"156","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Goldberg Andrew V.","year":"2005","unstructured":"Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 156\u2013165. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070455."},{"key":"e_1_3_2_102_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_52"},{"key":"e_1_3_2_103_2","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_104_2","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_105_2","doi-asserted-by":"publisher","DOI":"10.1145\/3174803"},{"key":"e_1_3_2_106_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.132"},{"key":"e_1_3_2_107_2","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00269"},{"key":"e_1_3_2_108_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34862-4_16"},{"key":"e_1_3_2_109_2","doi-asserted-by":"publisher","DOI":"10.1145\/2444016.2444021"},{"key":"e_1_3_2_110_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_37"},{"key":"e_1_3_2_111_2","unstructured":"LIPIcs Proceedings of the 28th Annual European Symposium on Algorithms 173 Fabrizio Grandoni Grzegorz Herman Peter Sanders 2020"},{"key":"e_1_3_2_112_2","doi-asserted-by":"publisher","DOI":"10.1145\/3019612.3019816"},{"key":"e_1_3_2_113_2","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"key":"e_1_3_2_114_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976496.10"},{"key":"e_1_3_2_115_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.65"},{"key":"e_1_3_2_116_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.156"},{"key":"e_1_3_2_117_2","doi-asserted-by":"publisher","DOI":"10.1145\/3110025.3110061"},{"key":"e_1_3_2_118_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SAND.2022.18"},{"key":"e_1_3_2_119_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SEA.2020.14"},{"key":"e_1_3_2_120_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976007.9"},{"key":"e_1_3_2_121_2","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983731"},{"key":"e_1_3_2_122_2","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850580"},{"key":"e_1_3_2_123_2","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529607"},{"key":"e_1_3_2_124_2","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.1996.495507"},{"key":"e_1_3_2_125_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73117-9_3"},{"key":"e_1_3_2_126_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2020.58"},{"key":"e_1_3_2_127_2","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_128_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.23"},{"key":"e_1_3_2_129_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977042.2"},{"key":"e_1_3_2_130_2","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking52078.2021.9472803"},{"key":"e_1_3_2_131_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60084-1_81"},{"key":"e_1_3_2_132_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01189067"},{"key":"e_1_3_2_133_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794263907"},{"key":"e_1_3_2_134_2","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009228"},{"key":"e_1_3_2_135_2","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225269"},{"key":"e_1_3_2_136_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63165-8_214"},{"key":"e_1_3_2_137_2","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320215"},{"key":"e_1_3_2_138_2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276715"},{"key":"e_1_3_2_139_2","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_140_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_62"},{"key":"e_1_3_2_141_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(99)00002-2"},{"key":"e_1_3_2_142_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2960226"},{"key":"e_1_3_2_143_2","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904486"},{"key":"e_1_3_2_144_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.32"},{"key":"e_1_3_2_145_2","first-page":"314","volume-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms.","author":"II Giuseppe Amato","year":"1997","unstructured":"Giuseppe Amato II, Giuseppe Cattaneo, and Giuseppe F. Italiano. 1997. Experimental analysis of dynamic minimum spanning tree algorithms (extended abstract). In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms.Michael E. Saks (Ed.), ACM\/SIAM, 314\u2013323. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=314161.314314."},{"key":"e_1_3_2_146_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-2864-4_154"},{"key":"e_1_3_2_147_2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-57899-4_44","volume-title":"Proceedings of the 19th International Workshop Graph-Theoretic Concepts in Computer Science","volume":"790","author":"Ivkovic Zoran","year":"1993","unstructured":"Zoran Ivkovic and Errol L. Lloyd. 1993. Fully dynamic maintenance of vertex cover. In Proceedings of the 19th International Workshop Graph-Theoretic Concepts in Computer Science. 790. 99\u2013111."},{"key":"e_1_3_2_148_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2016.189"},{"key":"e_1_3_2_149_2","doi-asserted-by":"publisher","DOI":"10.1145\/945394.945398"},{"key":"e_1_3_2_150_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2835441"},{"key":"e_1_3_2_151_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00088"},{"key":"e_1_3_2_152_2","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_72"},{"key":"e_1_3_2_153_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.81"},{"key":"e_1_3_2_154_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2019.4"},{"key":"e_1_3_2_155_2","doi-asserted-by":"publisher","DOI":"10.1145\/3396375"},{"key":"e_1_3_2_156_2","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2500270"},{"key":"e_1_3_2_157_2","doi-asserted-by":"publisher","DOI":"10.1145\/3364212"},{"key":"e_1_3_2_158_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43659-3_11"},{"key":"e_1_3_2_159_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814580"},{"key":"e_1_3_2_160_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44679-6_30"},{"key":"e_1_3_2_161_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1128"},{"key":"e_1_3_2_162_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12848-6_3"},{"key":"e_1_3_2_163_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2419666"},{"key":"e_1_3_2_164_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498421"},{"key":"e_1_3_2_165_2","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1370597"},{"key":"e_1_3_2_166_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023607406540"},{"key":"e_1_3_2_167_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.053"},{"key":"e_1_3_2_168_2","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187884"},{"key":"e_1_3_2_169_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_3_2_170_2","doi-asserted-by":"publisher","DOI":"10.1145\/3022186"},{"key":"e_1_3_2_171_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783285"},{"key":"e_1_3_2_172_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2021.6"},{"key":"e_1_3_2_173_2","article-title":"A survey of shortest-path algorithms","author":"Madkour Amgad","year":"2017","unstructured":"Amgad Madkour, Walid G. Aref, Faizan Ur Rehman, Mohamed Abdur Rahman, and Saleh Basalamah. 2017. A survey of shortest-path algorithms. arXiv:1705.02044. Retrieved from https:\/\/arxiv.org\/abs\/1705.02044.","journal-title":"arXiv:1705.02044"},{"key":"e_1_3_2_174_2","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2017.00011"},{"key":"e_1_3_2_175_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00075-0"},{"key":"e_1_3_2_176_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2009.114"},{"key":"e_1_3_2_177_2","volume-title":"Proceedings of the Algorithm Engineering, 27.06.\u201302.07.2010 (Dagstuhl Seminar Proc.)","volume":"10261","author":"Meyerhenke Henning","year":"2010","unstructured":"Henning Meyerhenke and Joachim Gehweiler. 2010. On dynamic graph partitioning and graph clustering using diffusion. In Proceedings of the Algorithm Engineering, 27.06.\u201302.07.2010 (Dagstuhl Seminar Proc.), Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, and Peter Sanders (Eds.), Vol. 10261. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany. Retrieved from http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2010\/2798\/."},{"key":"e_1_3_2_178_2","volume-title":"Proceedings of the Notes of the 2009 NIPS Workshop on Analyzing Networks and Learning with Graphs, Whistler, BC, Canada","author":"Miller Kurt T.","year":"2009","unstructured":"Kurt T. Miller and Tina Eliassi-Rad. 2009. Continuous time group discovery in dynamic graphs. In Proceedings of the Notes of the 2009 NIPS Workshop on Analyzing Networks and Learning with Graphs, Whistler, BC, Canada."},{"key":"e_1_3_2_179_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90159-7"},{"key":"e_1_3_2_180_2","unstructured":"Daniele Miorandi and Francesco De Pellegrini. 2010. K-shell decomposition for dynamic complex networks See Ariel Orda [19] 488\u2013496. Retrieved from http:\/\/ieeexplore.ieee.org\/document\/5520231\/."},{"key":"e_1_3_2_181_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.850180"},{"key":"e_1_3_2_182_2","doi-asserted-by":"publisher","DOI":"10.1186\/s12918-018-0533-6"},{"key":"e_1_3_2_183_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12030052"},{"key":"e_1_3_2_184_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.893870"},{"key":"e_1_3_2_185_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.974525"},{"key":"e_1_3_2_186_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44465-8_49"},{"key":"e_1_3_2_187_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78024-5_26"},{"key":"e_1_3_2_188_2","doi-asserted-by":"publisher","DOI":"10.1145\/3110025.3110034"},{"key":"e_1_3_2_189_2","doi-asserted-by":"publisher","DOI":"10.1145\/2700206"},{"key":"e_1_3_2_190_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_191_2","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2015.04"},{"key":"e_1_3_2_192_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806753"},{"key":"e_1_3_2_193_2","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"e_1_3_2_194_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806772"},{"key":"e_1_3_2_195_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"key":"e_1_3_2_196_2","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"e_1_3_2_197_2","doi-asserted-by":"publisher","DOI":"10.5555\/1862199.1862208"},{"key":"e_1_3_2_198_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24838-5_29"},{"key":"e_1_3_2_199_2","doi-asserted-by":"publisher","DOI":"10.1145\/1187436.1210590"},{"key":"e_1_3_2_200_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:SQJO.0000039791.93071.a2"},{"key":"e_1_3_2_201_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-13469-3_31"},{"key":"e_1_3_2_202_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48971-0_29"},{"key":"e_1_3_2_203_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341161.3344829"},{"key":"e_1_3_2_204_2","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1227166"},{"key":"e_1_3_2_205_2","volume-title":"On the Computational Complexity of Incremental Algorithms","author":"Ramalingam G.","year":"1991","unstructured":"G. Ramalingam and Thomas Reps. 1991. On the Computational Complexity of Incremental Algorithms. Technical Report. University of Wisconsin-Madison Department of Computer Sciences."},{"key":"e_1_3_2_206_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"e_1_3_2_207_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"e_1_3_2_208_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_30"},{"key":"e_1_3_2_209_2","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556224"},{"key":"e_1_3_2_210_2","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328917"},{"key":"e_1_3_2_211_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9401-5"},{"key":"e_1_3_2_212_2","doi-asserted-by":"publisher","DOI":"10.1137\/090776573"},{"key":"e_1_3_2_213_2","doi-asserted-by":"publisher","DOI":"10.1137\/13093618X"},{"key":"e_1_3_2_214_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.111"},{"key":"e_1_3_2_215_2","doi-asserted-by":"publisher","DOI":"10.1145\/3172867"},{"key":"e_1_3_2_216_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.02.001"},{"key":"e_1_3_2_217_2","doi-asserted-by":"publisher","DOI":"10.1145\/2938503.2938506"},{"key":"e_1_3_2_218_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.25"},{"key":"e_1_3_2_219_2","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_47"},{"key":"e_1_3_2_220_2","doi-asserted-by":"publisher","DOI":"10.1145\/1283383.1283397"},{"key":"e_1_3_2_221_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0423-8"},{"key":"e_1_3_2_222_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691611"},{"key":"e_1_3_2_223_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2013.6702680"},{"key":"e_1_3_2_224_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.01.003"},{"key":"e_1_3_2_225_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21233-3_5"},{"key":"e_1_3_2_226_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1410"},{"key":"e_1_3_2_227_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2000.10035"},{"key":"e_1_3_2_228_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.605"},{"key":"e_1_3_2_229_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_6"},{"key":"e_1_3_2_230_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43659-3_24"},{"key":"e_1_3_2_231_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.51"},{"key":"e_1_3_2_232_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59416-9_32"},{"key":"e_1_3_2_233_2","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"issue":"2","key":"e_1_3_2_234_2","first-page":"217","article-title":"Parallel batch dynamic single source shortest path algorithm and its implementation on GPU based machine","volume":"16","author":"Singh Dhirendra","year":"2019","unstructured":"Dhirendra Singh and Nilay Khare. 2019. Parallel batch dynamic single source shortest path algorithm and its implementation on GPU based machine. International Arab Journal of Information Technology 16, 2 (2019), 217\u2013225. Retrieved from http:\/\/iajit.org\/index.php?option=com_content&task=blogcategory&id=137&Itemid=469.","journal-title":"International Arab Journal of Information Technology"},{"key":"e_1_3_2_235_2","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802464"},{"key":"e_1_3_2_236_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.43"},{"key":"e_1_3_2_237_2","doi-asserted-by":"publisher","DOI":"10.1145\/3059194"},{"key":"e_1_3_2_238_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2017.58"},{"key":"e_1_3_2_239_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385416"},{"key":"e_1_3_2_240_2","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1594231"},{"key":"e_1_3_2_241_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_33"},{"key":"e_1_3_2_242_2","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060607"},{"key":"e_1_3_2_243_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0045-2"},{"key":"e_1_3_2_244_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44985-X_1"},{"key":"e_1_3_2_245_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.8"},{"key":"e_1_3_2_246_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00035"},{"key":"e_1_3_2_247_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00036"},{"key":"e_1_3_2_248_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2018.42"},{"key":"e_1_3_2_249_2","unstructured":"Luis M. Vaquero F\u00e9lix Cuadrado Dionysios Logothetis and Claudio Martella. 2013. xDGP: A dynamic graph processing system with adaptive partitioning. arXiv:1309.1049. http:\/\/arxiv.org\/abs\/1309.1049."},{"key":"e_1_3_2_250_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2014.23"},{"key":"e_1_3_2_251_2","doi-asserted-by":"publisher","DOI":"10.5244\/C.26.61"},{"key":"e_1_3_2_252_2","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1103378"},{"key":"e_1_3_2_253_2","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1407"},{"key":"e_1_3_2_254_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.288"},{"key":"e_1_3_2_255_2","doi-asserted-by":"publisher","DOI":"10.1145\/2038633.2038638"},{"key":"e_1_3_2_256_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00063"},{"key":"e_1_3_2_257_2","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733097"},{"key":"e_1_3_2_258_2","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364329"},{"key":"e_1_3_2_259_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.135"},{"key":"e_1_3_2_260_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32149-3_20"},{"key":"e_1_3_2_261_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36383-1_11"},{"key":"e_1_3_2_262_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.93"},{"key":"e_1_3_2_263_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00016"},{"key":"e_1_3_2_264_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00083"},{"key":"e_1_3_2_265_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2550042"},{"key":"e_1_3_2_266_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2951419"},{"key":"e_1_3_2_267_2","volume-title":"Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9\u201312, 2019","author":"Zuckerman David","year":"2019","unstructured":"David Zuckerman (Ed.). 2019. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9\u201312, 2019. IEEE Computer Society. Retrieved from https:\/\/ieeexplore.ieee.org\/xpl\/conhome\/8936052\/proceeding."}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:36Z","timestamp":1750182696000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,13]]},"references-count":266,"alternative-id":["10.1145\/3555806"],"URL":"https:\/\/doi.org\/10.1145\/3555806","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,13]]}}}