research-article

Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide

Authors:
Kathrin Hanauer

Faculty of Computer Science, University of Vienna, Vienna, Austria

Faculty of Computer Science, University of Vienna, Vienna, Austria

0000-0002-5945-837X
View Profile

,
Monika Henzinger

Faculty of Computer Science, University of Vienna, Vienna, Austria

Faculty of Computer Science, University of Vienna, Vienna, Austria

0000-0002-5008-6530
View Profile

,
Christian Schulz

Heidelberg University, Heidelberg, Baden-Württemberg, Germany

Heidelberg University, Heidelberg, Baden-Württemberg, Germany

0000-0002-2823-3506
View Profile

ACM Journal of Experimental Algorithmics Volume 27Article No.: 1.11pp 1–45https://doi.org/10.1145/3555806

Published:13 December 2022Publication History

ACM Journal of Experimental Algorithmics

Abstract

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.

REFERENCES

[1] Abboud Amir, Addanki Raghavendra, Grandoni Fabrizio, Panigrahi Debmalya, and Saha Barna. 2019. Dynamic set cover: Improved algorithms and lower bounds. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Charikar Moses and Cohen Edith (Eds.). ACM, 114–125. DOI:Google ScholarDigital Library
[2] Abboud Amir and Dahlgaard Søren. 2016. Popular conjectures as a barrier for dynamic planar graph algorithms. In Proceedings of the 2016 IEEE 57th Annual Symposium on Foundations of Computer Science. IEEE, 477–486.Google ScholarCross Ref
[3] Abboud Amir and Williams Virginia Vassilevska. 2014. Popular conjectures imply strong lower bounds for dynamic problems. In Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. IEEE, 434–443. DOI:Google ScholarDigital Library
[4] Abraham Ittai, Chechik Shiri, and Krinninger Sebastian. 2017. Fully dynamic all-pairs shortest paths with worst-case update-time revisited. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Klein Philip N. (Ed.). SIAM, 440–452. DOI:Google ScholarCross Ref
[5] Abraham Ittai, Chechik Shiri, and Talwar Kunal. 2014. Fully dynamic all-pairs shortest paths: Breaking the \(O(n)\) barrier. In Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4–6, 2014, Barcelona, Spain (LIPIcs), Jansen Klaus, Rolim José D. P., Devanur Nikhil R., and Moore Cristopher (Eds.), Vol. 28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1–16. DOI:Google ScholarCross Ref
[6] Acar Umut A., Anderson Daniel, Blelloch Guy E., and Dhulipala Laxman. 2019. Parallel batch-dynamic graph connectivity. In Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA, Scheideler Christian and Berenbrink Petra (Eds.), ACM, 381–392. DOI:Google ScholarDigital Library
[7] Acar Umut A., Anderson Daniel, Blelloch Guy E., Dhulipala Laxman, and Westrick Sam. 2020. Parallel batch-dynamic trees via change propagation. In Proceedings of the 28th Annual European Symposium on Algorithms.Grandoni Fabrizio, Herman Grzegorz, and Sanders Peter (Eds.), Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2:1–2:23. DOI:Google ScholarCross Ref
[8] Ahmed Nesreen K., Duffield Nick G., Willke Theodore L., and Rossi Ryan A.. 2017. On sampling from massive graph streams. Proceedings of the VLDB Endowment 10, 11 (2017), 1430–1441. DOI:Google ScholarDigital Library
[9] Akiba Takuya, Iwata Yoichi, and Yoshida Yuichi. 2014. Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In Proceedings of the 23rd International World Wide Web Conference.Chung Chin-Wan, Broder Andrei Z., Shim Kyuseok, and Suel Torsten (Eds.), ACM, 237–248. DOI:Google ScholarDigital Library
[10] Alberts David, Cattaneo Giuseppe, and Italiano Giuseppe F.. 1997. An empirical study of dynamic graph algorithms. ACM Journal of Experimental Algorithmics 2 (1997), 5. DOI:Google ScholarDigital Library
[11] Alberts David, Cattaneo Giuseppe, Italiano Giuseppe F., Nanni Umberto, and Zaroliagis Christos. 1998. A software library of dynamic graph algorithms. In Proceedings of the Workshop on Algorithms and Experiments. Citeseer, 129–136.Google Scholar
[12] Alpern Bowen, Hoover Roger, Rosen Barry K., Sweeney Peter F., and Zadeck F. Kenneth. 1990. Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, Johnson David S. (Ed.), SIAM, 32–42. http://dl.acm.org/citation.cfm?id=320176.320180.Google ScholarDigital Library
[13] Alvari Hamidreza, Hajibagheri Alireza, and Sukthankar Gita Reese. 2014. Community detection in dynamic social networks: A game-theoretic approach. In Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Wu Xindong, Ester Martin, and Xu Guandong (Eds.), IEEE Computer Society, 101–107. DOI:Google ScholarCross Ref
[14] Anand Abhash, Baswana Surender, Gupta Manoj, and Sen Sandeep. 2012. Maintaining approximate maximum weighted matching in fully dynamic graphs. In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. D’Souza Deepak, Kavitha Telikepalli, and Radhakrishnan Jaikumar (Eds.), Vol. 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 257–266. DOI:Google ScholarCross Ref
[15] Ancona Bertie, Henzinger Monika, Roditty Liam, Williams Virginia Vassilevska, and Wein Nicole. 2019. Algorithms and hardness for diameter in dynamic graphs. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming. Baier Christel, Chatzigiannakis Ioannis, Flocchini Paola, and Leonardi Stefano (Eds.), Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 13:1–13:14. DOI:Google ScholarCross Ref
[16] Angriman Eugenio, Meyerhenke Henning, Schulz Christian, and Uçar Bora. 2021. Fully-dynamic weighted matching approximation in practice. In Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms.Bender Michael, Gilbert John, Hendrickson Bruce, and Sullivan Blair D. (Eds.), SIAM, 32–44. DOI:Google ScholarCross Ref
[17] Arar Moab, Chechik Shiri, Cohen Sarel, Stein Cliff, and Wajc David. 2018. Dynamic matching: Reducing integral algorithms to approximately-maximal fractional algorithms. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. 7:1–7:16. DOI:Google ScholarCross Ref
[18] Aridhi Sabeur, Brugnara Martin, Montresor Alberto, and Velegrakis Yannis. 2016. Distributed k-core decomposition and maintenance in large dynamic graphs. In Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems. 161–168. DOI:Google ScholarDigital Library
[19] Hegde Lavy Libman Ariel Orda and Nidhi (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.Google Scholar
[20] Assadi Sepehr, Onak Krzysztof, Schieber Baruch, and Solomon Shay. 2018. Fully dynamic maximal independent set with sublinear update time. In Proc. of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25–29, 2018, Diakonikolas Ilias, Kempe David, and Henzinger Monika (Eds.). ACM, 815–826. DOI:Google ScholarDigital Library
[21] Assadi Sepehr, Onak Krzysztof, Schieber Baruch, and Solomon Shay. 2019. Fully dynamic maximal independent set with sublinear in n update time. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms.Chan Timothy M. (Ed.). SIAM, 1919–1936. DOI:Google ScholarCross Ref
[22] Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M.. 2012. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer Science & Business Media.Google Scholar
[23] Awad Muhammad A., Ashkiani Saman, Porumbescu Serban D., and Owens John D.. 2020. Dynamic graphs on the GPU. In Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium. IEEE, 739–748. DOI:Google ScholarCross Ref
[24] Aynaud Thomas and Guillaume Jean-Loup. 2010. Static community detection algorithms for evolving networks, See Ariel Orda [19], 513–519. Retrieved from http://ieeexplore.ieee.org/document/5520221/.Google Scholar
[25] Bansal Shweta, Bhowmick Sanjukta, and Paymal Prashant. 2010. Fast community detection for dynamic complex networks. In Proceedings of the Second International Workshop of Complex Networks. Revised Selected Papers (Communications in Computer and Information Science), Costa Luciano da F., Evsukoff Alexandre G., Mangioni Giuseppe, and Menezes Ronaldo (Eds.), Vol. 116. Springer, 196–207. DOI:Google ScholarCross Ref
[26] Baswana Surender, Chaudhury Shreejit Ray, Choudhary Keerti, and Khan Shahbaz. 2019. Dynamic DFS in undirected graphs: Breaking the \(O(m)\) barrier. SIAM Journal on Computing 48, 4 (2019), 1335–1363. DOI:Google ScholarDigital Library
[27] Baswana Surender, Gupta Manoj, and Sen Sandeep. 2015. Fully dynamic maximal matching in \({O}(\log n)\) update time. SIAM Journal on Computing 44, 1 (2015), 88–113. DOI:Google ScholarCross Ref
[28] Baswana Surender, Gupta Shiv Kumar, and Tulsyan Ayush. 2019. Fault tolerant and fully dynamic DFS in undirected graphs: Simple yet efficient. In Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science.Rossmanith Peter, Heggernes Pinar, and Katoen Joost-Pieter (Eds.), Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 65:1–65:16. DOI:Google ScholarCross Ref
[29] Bauer Reinhard, Delling Daniel, Sanders Peter, Schieferdecker Dennis, Schultes Dominik, and Wagner Dorothea. 2010. Combining hierarchical and goal-directed speed-up techniques for dijkstra’s algorithm. ACM Journal of ExperimentalAlgorithmics 15 (2010). DOI:Google ScholarDigital Library
[30] Bauer Reinhard and Wagner Dorothea. 2009. Batch dynamic single-source shortest-path algorithms: An experimental study. In Proceedings of the 8th International Symposium on Experimental Algorithms. Proc. (Lecture Notes in Computer Science), Vahrenhold Jan (Ed.), Vol. 5526. Springer, 51–62. DOI:Google ScholarDigital Library
[31] Becker F.. 2020. Generative Model for Dynamic Networks with Community Structures. Master’s Thesis. Heidelberg University.Google Scholar
[32] Behnezhad Soheil, Derakhshan Mahsa, Hajiaghayi MohammadTaghi, Stein Cliff, and Sudan Madhu. 2019. Fully dynamic maximal independent set with polylogarithmic update time, In Proceedings of the 2019 IEEE 60th Annual Symposium on Foundations of Computer (FOCS’19), 382–405. DOI:Google ScholarCross Ref
[33] Behnezhad Soheil, Lacki Jakub, and Mirrokni Vahab S.. 2020. Fully dynamic matching: Beating 2-approximation in \(\Delta ^{\epsilon }\) update time. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms.Chawla Shuchi (Ed.), SIAM, 2492–2508. DOI:Google ScholarCross Ref
[34] Bellman Richard. 1958. On a routing problem. Quarterly of Applied Mathematics 16, 1 (1958), 87–90.Google ScholarCross Ref
[35] Bergamaschi Thiago, Henzinger Monika, Gutenberg Maximilian Probst, Williams Virginia Vassilevska, and Wein Nicole. 2021. New techniques and fine-grained hardness for dynamic near-additive spanners. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms.Marx Dániel (Ed.), SIAM, 1836–1855. DOI:Google ScholarCross Ref
[36] Bergamini Elisabetta and Meyerhenke Henning. 2015. Fully-dynamic approximation of betweenness centrality. In Proceedings of the 23rd Annual European Symposium Algorithms.Bansal Nikhil and Finocchi Irene (Eds.), Vol. 9294. Springer, 155–166. DOI:Google ScholarCross Ref
[37] Bergamini Elisabetta and Meyerhenke Henning. 2016. Approximating betweenness centrality in fully dynamic networks. Internet Mathematics 12, 5 (2016), 281–314. DOI:Google ScholarCross Ref
[38] Bergamini Elisabetta, Meyerhenke Henning, and Staudt Christian. 2015. Approximating betweenness centrality in large evolving networks. In Proceedings of the 17th Workshop on Algorithm Engineering and Experiments.,Brandes Ulrik and Eppstein David (Eds.), SIAM, 133–146. DOI:Google ScholarCross Ref
[39] Bernstein Aaron, Forster Sebastian, and Henzinger Monika. 2019. A deamortization approach for dynamic spanner and dynamic maximal matching. In Proceeding of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, Chan Timothy M. (Ed.), SIAM, 1899–1918. DOI:Google ScholarCross Ref
[40] Bernstein Aaron and Stein Cliff. 2016. Faster fully dynamic matchings with small approximation ratios. In Proceedings of the 27th Symposium on Discrete Algorithms. SIAM, 692–711. DOI:Google ScholarCross Ref
[41] Berrettini Emanuele, D’Angelo Gianlorenzo, and Delling Daniel. 2009. Arc-flags in dynamic graphs. In Proceedings of the ATMOS 2009-9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.Clausen Jens and Stefano Gabriele Di (Eds.), Vol. 12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. Retrieved from http://drops.dagstuhl.de/opus/volltexte/2009/2149.Google Scholar
[42] Bhattacharya Sayan, Chakrabarty Deeparnab, and Henzinger Monika. 2020. Deterministic dynamic matching in O(1) update time. Algorithmica 82, 4 (2020), 1057–1080. DOI:Google ScholarDigital Library
[43] Bhattacharya Sayan, Henzinger Monika, and Italiano Giuseppe F.. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing 47, 3 (2018), 859–887. DOI:Google ScholarDigital Library
[44] Bhattacharya Sayan, Henzinger Monika, and Italiano Giuseppe F.. 2018. Dynamic algorithms via the primal-dual method. Information and Computation 261 (2018), 219–239. DOI:Google ScholarDigital Library
[45] Bhattacharya Sayan, Henzinger Monika, and Nanongkai Danupon. 2016. New deterministic approximation algorithms for fully dynamic matching. In Proceedings of the 48th Annual Symposium on Theory of Computing. ACM, 398–411. DOI:Google ScholarDigital Library
[46] Bhattacharya Sayan, Henzinger Monika, and Nanongkai Danupon. 2017. Fully dynamic approximate maximum matching and minimum vertex cover in O(log\({}^{\mbox{3}}\)n) worst case update time. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms.Klein Philip N. (Ed.). SIAM, 470–489. DOI:Google ScholarCross Ref
[47] Bhattacharya Sayan, Henzinger Monika, and Nanongkai Danupon. 2019. A new deterministic algorithm for dynamic set cover. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science. Zuckerman David (Ed.), IEEE Computer Society, 406–423. DOI:Google ScholarCross Ref
[48] Bhattacharya Sayan, Henzinger Monika, Nanongkai Danupon, and Tsourakakis Charalampos E.. 2015. Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In Proceedings of the 47th Annual ACM on Symposium on Theory of Computing. Servedio Rocco A. and Rubinfeld Ronitt (Eds.), ACM, 173–182. DOI:Google ScholarDigital Library
[49] Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Xiaowei Wu. 2021. Dynamic set cover: improved amortized and worst-case update time. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA’21), Virtual Conference, January 10-13, 2021, Dániel Marx (Ed.). SIAM, 2537–2549. Retrieved from Google ScholarCross Ref
[50] Bhattacharya Sayan and Kulkarni Janardhan. 2019. Deterministically maintaining a (\(2 + \varepsilon\))-approximate minimum vertex cover in \(O(1/\varepsilon ^2)\) amortized update time. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete AlgorithmsChan Timothy M. (Ed.), SIAM, 1872–1885. DOI:Google ScholarCross Ref
[51] Bhore Sujoy, Li Guangping, and Nöllenburg Martin. 2020. An algorithmic study of fully dynamic independent sets for map labeling, See Grandoni et al. [110], 19:1–19:24. DOI:Google ScholarCross Ref
[52] Bisenius Patrick, Bergamini Elisabetta, Angriman Eugenio, and Meyerhenke Henning. 2018. Computing top-k closeness centrality in fully-dynamic graphs. In Proceedings of the 20th Workshop on Algorithm Engineering and Experiments.Pagh Rasmus and Venkatasubramanian Suresh (Eds.), SIAM, 21–35. DOI:Google ScholarCross Ref
[53] Boykov Yuri and Kolmogorov Vladimir. 2004. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 9 (2004), 1124–1137. DOI:Google ScholarDigital Library
[54] Brandes U., Delling D., Gaertler M., Gorke R., Hoefer M., Nikoloski Z., and Wagner D.. 2008. On modularity clustering. IEEE Transactions on Knowledge and Data Engineering 20, 2 (2008), 172–188. DOI:Google ScholarDigital Library
[55] Buchhold Valentin, Delling Daniel, Schieferdecker Dennis, and Wegner Michael. 2020. Fast and stable repartitioning of road networks. In Proceedings of the 18th International Symposium on Experimental Algorithms. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 26:1–26:15. DOI:Google ScholarCross Ref
[56] Bulteau Laurent, Froese Vincent, Kutzkov Konstantin, and Pagh Rasmus. 2016. Triangle counting in dynamic graph streams. Algorithmica 76, 1 (2016), 259–278. DOI:Google ScholarDigital Library
[57] Buriol Luciana S., Frahling Gereon, Leonardi Stefano, Marchetti-Spaccamela Alberto, and Sohler Christian. 2006. Counting triangles in data streams. In Proceedings of the 25th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Vansummeren Stijn (Ed.), ACM, 253–262. DOI:Google ScholarDigital Library
[58] Buriol Luciana S., Resende Mauricio G. C., and Thorup Mikkel. 2008. Speeding up dynamic shortest-path algorithms. INFORMS Journal on Computing 20, 2 (2008), 191–204. DOI:Google ScholarDigital Library
[59] Busato Federico, Green Oded, Bombieri Nicola, and Bader David A.. 2018. Hornet: An efficient data structure for dynamic sparse graphs and matrices on GPUs. In Proceedings of the 2018 IEEE High Performance Extreme Computing Conference. IEEE, 1–7. DOI:Google ScholarCross Ref
[60] Cattaneo Giuseppe, Faruolo Pompeo, Petrillo Umberto Ferraro, and Italiano Giuseppe F.. 2002. Maintaining dynamic minimum spanning trees: An experimental study. In Proceedings of the 4th International Workshop on Algorithm Engineering and Experiments.Mount David M. and Stein Clifford (Eds.), Vol. 2409. Springer, 111–125. DOI:Google ScholarCross Ref
[61] Cattaneo Giuseppe, Faruolo Pompeo, Petrillo Umberto Ferraro, and Italiano Giuseppe F.. 2010. Maintaining dynamic minimum spanning trees: An experimental study. Discrete Applied Mathematics 158, 5 (2010), 404–425. DOI:Google ScholarDigital Library
[62] Chan Edward P. F. and Yang Yaya. 2009. Shortest path tree computation in dynamic graphs. IEEE Transactions on Computers 58, 4 (2009), 541–557. DOI:Google ScholarDigital Library
[63] Charikar Moses. 2000. Greedy approximation algorithms for finding dense components in a graph. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization.Jansen Klaus and Khuller Samir (Eds.), Vol. 1913. Springer, 84–95. DOI:Google ScholarCross Ref
[64] Charikar Moses and Solomon Shay. 2018. Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrier. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming. Chatzigiannakis Ioannis, Kaklamanis Christos, Marx Dániel, and Sannella Donald (Eds.), Vol. 107. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 33:1–33:14. DOI:Google ScholarCross Ref
[65] Chechik Shiri and Zhang Tianyi. 2019. Fully dynamic maximal independent set in expected poly-log update time, See Zuckerman [266], 370–381. DOI:Google ScholarCross Ref
[66] Chehreghani Mostafa Haghir, Bifet Albert, and Abdessalem Talel. 2018. DyBED: An efficient algorithm for updating betweenness centrality in directed dynamic graphs. In Proceedings of the IEEE International Conference on Big Data, Big Data 2018. Abe Naoki, Liu Huan, Pu Calton, Hu Xiaohua, Ahmed Nesreen K., Qiao Mu, Song Yang, Kossmann Donald, Liu Bing, Lee Kisung, Tang Jiliang, He Jingrui, and Saltz Jeffrey S. (Eds.), IEEE, 2114–2123. DOI:Google ScholarCross Ref
[67] Chen Li, Goranci Gramoz, Henzinger Monika, Peng Richard, and Saranurak Thatchaphol. 2020. Fast dynamic cuts, distances and effective resistances via vertex sparsifiers. In Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science. IEEE, 1135–1146. DOI:Google ScholarCross Ref
[68] Cionini Alessio, D’Angelo Gianlorenzo, D’Emidio Mattia, Frigioni Daniele, Giannakopoulou Kalliopi, Paraskevopoulos Andreas, and Zaroliagis Christos D.. 2017. Engineering graph-based models for dynamic timetable information systems. Journal of Discrete Algorithms 46–47 (2017), 40–58. DOI:Google ScholarCross Ref
[69] Crescenzi Pierluigi, Magnien Clémence, and Marino Andrea. 2020. Finding Top-k nodes for temporal closeness in large temporal graphs. Algorithms 13, 9 (2020), 211. DOI:Google ScholarCross Ref
[70] Crouch Michael and Stubbs Daniel S.. 2014. Improved streaming algorithms for weighted matching, via unweighted matching. In Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.Jansen Klaus, Rolim José D. P., Devanur Nikhil R., and Moore Cristopher (Eds.), Vol. 28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 96–104. DOI:Google ScholarCross Ref
[71] D’Andrea Annalisa, D’Emidio Mattia, Frigioni Daniele, Leucci Stefano, and Proietti Guido. 2015. Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: New algorithms and experiments. ACM Journal of Experimental Algorithmics 20 (2015), 1.5:1.1–1.5:1.33. DOI:Google ScholarDigital Library
[72] D’Angelo Gianlorenzo, D’Emidio Mattia, and Frigioni Daniele. 2014. Fully dynamic update of arc-flags. Networks 63, 3 (2014), 243–259. DOI:Google ScholarDigital Library
[73] D’Angelo Gianlorenzo, D’Emidio Mattia, and Frigioni Daniele. 2019. Fully dynamic 2-Hop cover labeling. ACM Journal of Experimental Algorithmics 24, 1 (2019), 1.6:1–1.6:36. DOI:Google ScholarDigital Library
[74] Delling Daniel, Goldberg Andrew V., Pajor Thomas, and Werneck Renato Fonseca F.. 2011. Customizable route planning. In Proceedings of the 10th International Symposium on Experimental Algorithms.Pardalos Panos M. and Rebennack Steffen (Eds.), Vol. 6630. Springer, 376–387. DOI:Google ScholarCross Ref
[75] Delling Daniel and Wagner Dorothea. 2007. Landmark-based routing in dynamic graphs, See Demetrescu [77], 52–65. DOI:Google ScholarCross Ref
[76] Demetrescu Camil. 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.Google Scholar
[77] Demetrescu Camil (Ed.). 2007. In Proceedings of the 6th International Workshop on Experimental Algorithms, Springer. DOI:Google ScholarCross Ref
[78] Demetrescu Camil, Frigioni Daniele, Marchetti-Spaccamela Alberto, and Nanni Umberto. 2000. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proceedings of the 4th International Workshop on Algorithm Engineering. Näher Stefan and Wagner Dorothea (Eds.), Vol. 1982. Springer, 218–229. DOI:Google ScholarCross Ref
[79] Demetrescu Camil and Italiano Giuseppe F.. 2004. A new approach to dynamic all pairs shortest paths. Journal of the ACM 51, 6 (2004), 968–992. DOI:Google ScholarDigital Library
[80] Demetrescu Camil and Italiano Giuseppe F.. 2006. Experimental analysis of dynamic all pairs shortest path algorithms. ACM Transactions on Algorithms 2, 4 (2006), 578–601. DOI:Google ScholarDigital Library
[81] Dhulipala Laxman, Liu Quanquan C.Shun Julian, and Shangdi Yu. 2021. Parallel batch-dynamic k-clique counting. In Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems (APOCS’20), Virtual Conference, January 13, 2021, Michael Schapira (Ed.). SIAM, 129–143. Retrieved from Google ScholarCross Ref
[82] Diesner Jana, Ferrari Elena, and Xu Guandong (Eds.). 2017. In Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017. ACM. DOI:Google ScholarDigital Library
[83] Dijkstra Edsger W.. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959), 269–271. DOI:Google ScholarDigital Library
[84] Doll Christof, Hartmann Tanja, and Wagner Dorothea. 2011. Fully-dynamic hierarchical graph clustering using cut trees. In Proceedings of the 12th International Symposium on Algorithms and Data Structures. DOI:Google ScholarCross Ref
[85] Ediger David, McColl Robert, Riedy E. Jason, and Bader David A.. 2012. STINGER: High performance data structure for streaming graphs. In Proceedings of the IEEE Conference on High Performance Extreme Computing. IEEE, 1–5. DOI:Google ScholarCross Ref
[86] Edmonds Jack R. and Karp Richard M.. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19, 2 (1972), 248–264. DOI:Google ScholarDigital Library
[87] Eppstein David, Galil Zvi, Italiano Giuseppe F., and Spencer Thomas H.. 1996. Separator based sparsification. I. planary testing and minimum spanning trees. Journal of Computer and System Sciences 52, 1 (1996), 3–27. DOI:Google ScholarDigital Library
[88] Eppstein David, Galil Zvi, Italiano Giuseppe F., and Spencer Thomas H.. 1998. Separator-based sparsification II: Edge and vertex connectivity. SIAM Journal on Computing 28, 1 (1998), 341–381. DOI:Google ScholarDigital Library
[89] Eppstein David, Goodrich Michael T., Strash Darren, and Trott Lowell. 2012. Extended dynamic subgraph statistics using h-index parameterized data structures. Theoretical Computer Science 447 (2012), 44–52. DOI:Google ScholarDigital Library
[90] Eppstein David and Spiro Emma S.. 2012. The h-Index of a graph and its application to dynamic subgraph statistics. Journal of Graph Algorithms and Applications 16, 2 (2012), 543–567. DOI:Google ScholarCross Ref
[91] Fan Wenfei, Liu Muyang, Tian Chao, Xu Ruiqi, and Zhou Jingren. 2020. Incrementalization of graph partitioning algorithms. Proceedings of the VLDB Endowment 13, 8 (2020), 1261–1274. DOI:Google ScholarDigital Library
[92] Feng Guoyao, Meng Xiao, and Ammar Khaled. 2015. DISTINGER: A distributed graph data structure for massive dynamic graph processing. In Proceedings of the 2015 IEEE International Conference on Big Data (Big Data). IEEE, 1814–1822. DOI:Google ScholarDigital Library
[93] Forster Sebastian, Goranci Gramoz, and Henzinger Monika. 2021. Dynamic maintenance of low-stretch probabilistic tree embeddings with applications. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA’21), Virtual Conference, January 10-13, 2021, Dániel Marx (Ed.). SIAM, 1226–1245, Retrieved from Google ScholarCross Ref
[94] Frederickson Greg N.. 1985. Data structures for on-line updating of minimum spanning trees, with applications. SIAM Journal on Computing 14, 4 (1985), 781–798. DOI:Google ScholarDigital Library
[95] Frederickson Greg N.. 1997. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM Journal on Computing 26, 2 (1997), 484–538. DOI:Google ScholarDigital Library
[96] Frigioni Daniele, Ioffreda Mario, Nanni Umberto, and Pasqualone Giulio. 1998. Experimental analysis of dynamic algorithms for the single-source shortest-path problem. ACM Journal of Experimental Algorithmics 3 (1998), 5. DOI:Google ScholarDigital Library
[97] Frigioni Daniele, Marchetti-Spaccamela Alberto, and Nanni Umberto. 1996. Fully dynamic output bounded single source shortest path problem (extended abstract). In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. Tardos Éva (Ed.). ACM/SIAM, 212–221. Retrieved from http://dl.acm.org/citation.cfm?id=313852.313926.Google Scholar
[98] Frigioni Daniele, Miller Tobias, Nanni Umberto, and Zaroliagis Christos D.. 2001. An experimental study of dynamic algorithms for transitive closure. ACM Journal of Experimental Algorithmics 6 (2001), 9. DOI:Google ScholarDigital Library
[99] Giannakopoulou Kalliopi, Paraskevopoulos Andreas, and Zaroliagis Christos D.. 2019. Multimodal dynamic journey-planning. Algorithms 12, 10 (2019), 213. DOI:Google ScholarCross Ref
[100] Goldberg Andrew V. and Harrelson Chris. 2005. Computing the shortest path: A search meets graph theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 156–165. Retrieved from http://dl.acm.org/citation.cfm?id=1070432.1070455.Google ScholarDigital Library
[101] Goldberg Andrew V., Hed Sagi, Kaplan Haim, Kohli Pushmeet, Tarjan Robert Endre, and Werneck Renato F.. 2015. Faster and more dynamic maximum flow by incremental breadth-first search. In Proceedings of the ESA 2015–23rd Annual European Symposium.Bansal Nikhil and Finocchi Irene (Eds.), Vol. 9294. Springer, 619–630. DOI:Google ScholarCross Ref
[102] Goldberg Andrew V. and Tarjan Robert Endre. 1988. A new approach to the maximum-flow problem. Journal of ACM 35, 4 (1988), 921–940. DOI:Google ScholarDigital Library
[103] Goldberg Andrew V. and Tarjan Robert E.. 1988. A new approach to the maximum-flow problem. Journal of ACM 35, 4 (1988), 921–940.Google ScholarDigital Library
[104] Goranci Gramoz, Henzinger Monika, and Thorup Mikkel. 2018. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transacions on Algorithms 14, 2 (2018), 1–21.Google ScholarDigital Library
[105] Goranci Gramoz, Räcke Harald, Saranurak Thatchaphol, and Tan Zihan. 2021. The expander hierarchy and its applications to dynamic graph algorithms. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA’21), Virtual Conference, January 10-13, 2021, Dániel Marx (Ed.). SIAM, 2212–2228, Retrieved from Google ScholarCross Ref
[106] Görke Robert, Hartmann Tanja, and Wagner Dorothea. 2012. Dynamic graph clustering using minimum-cut trees. Journal of Graph Algorithms and Applications 16, 2 (2012), 411–446. DOI:Google ScholarCross Ref
[107] Görke Robert, Kluge Roland, Schumm Andrea, Staudt Christian, and Wagner Dorothea. 2012. An efficient generator for clustered dynamic random networks. In Proceedings of the Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms.Even Guy and Rawitz Dror (Eds.), Vol. 7659. Springer, 219–233. DOI:Google ScholarDigital Library
[108] Görke Robert, Maillard Pascal, Schumm Andrea, Staudt Christian, and Wagner Dorothea. 2013. Dynamic graph clustering combining modularity and smoothness. ACM Journal of Experimental Algorithmics 18 (2013). DOI:Google ScholarDigital Library
[109] Görke Robert, Maillard Pascal, Staudt Christian, and Wagner Dorothea. 2010. Modularity-driven clustering of dynamic graphs. In Proceedings of the 9th International Symposium on Experimental AlgorithmsFesta Paola (Ed.), Vol. 6049. Springer, 436–448. DOI:Google ScholarDigital Library
[110] Grandoni Fabrizio, Herman Grzegorz, and Sanders Peter (Eds.). 2020. In Proceedings of the 28th Annual European Symposium on Algorithms. LIPIcs, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Google Scholar
[111] Greco Sergio, Molinaro Cristian, Pulice Chiara, and Quintana Ximena. 2017. Incremental maximum flow computation on evolving networks. In Proceedings of the Symposium on Applied Computing. Seffah Ahmed, Penzenstadler Birgit, Alves Carina, and Peng Xin (Eds.), ACM, 1061–1067. DOI:Google ScholarDigital Library
[112] Green Oded, McColl Robert, and Bader David A.. 2012. A fast algorithm for streaming betweenness centrality. In Proceedings of the 2012 International Conference on Privacy, Security, Risk and Trust, PASSAT 2012, and 2012 International Confernece on Social Computing, SocialCom 2012. IEEE Computer Society, 11–20. DOI:Google ScholarDigital Library
[113] Gupta Manoj and Khan Shahbaz. to appear, 2021. Simple dynamic algorithms for Maximal Independent Set and other problems. In Proceedings of the 4th Symposium on Simplicity in Algorithms. arXiv:1804.01823. http://arxiv.org/abs/1804.01823.Google ScholarCross Ref
[114] Gupta Manoj and Peng Richard. 2013. Fully dynamic \((1+\epsilon)\)-approximate matchings. In Proceedings of the 54th Symposium on Foundations of Computer Science. IEEE Computer Society, 548–557. DOI:Google ScholarDigital Library
[115] Gutenberg Maximilian Probst and Wulff-Nilsen Christian. 2020. Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Chawla Shuchi (Ed.). SIAM, 2562–2574. DOI:Google ScholarCross Ref
[116] Han Guyue and Sethu Harish. 2017. Edge sample and discard: A new algorithm for counting triangles in large dynamic graphs, See Diesner et al. [82], 44–49. DOI:Google ScholarDigital Library
[117] Hanauer Kathrin, Henzinger Monika, and Hua Qi Cheng. 2022. Fully dynamic four-vertex subgraph counting. In Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks. Aspnes James and Michail Othon (Eds.), Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 18:1–18:17. DOI:Google ScholarCross Ref
[118] Hanauer Kathrin, Henzinger Monika, and Schulz Christian. 2020. Faster fully dynamic transitive closure in practice. In Proceedings of the 18th International Symposium on Experimental Algorithms. Faro Simone and Cantone Domenico (Eds.), Vol. 160. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 14:1–14:14. DOI:Google ScholarCross Ref
[119] Hanauer Kathrin, Henzinger Monika, and Schulz Christian. 2020. Fully dynamic single-source reachability in practice: An experimental study. In Proceedings of the Symposium on Algorithm Engineering and Experiments.Blelloch Guy E. and Finocchi Irene (Eds.), SIAM, 106–119. DOI:Google ScholarCross Ref
[120] Hayashi Takanori, Akiba Takuya, and Kawarabayashi Ken-ichi. 2016. Fully dynamic shortest-path distance query acceleration on massive networks. In Proceedings of the 25th ACM International Conference on Information and Knowledge Management.Mukhopadhyay Snehasis, Zhai ChengXiang, Bertino Elisa, Crestani Fabio, Mostafa Javed, Tang Jie, Si Luo, Zhou Xiaofang, Chang Yi, Li Yunyao, and Sondhi Parikshit (Eds.), ACM, 1533–1542. DOI:Google ScholarDigital Library
[121] Hayashi Takanori, Akiba Takuya, and Yoshida Yuichi. 2015. Fully dynamic betweenness centrality maintenance on massive networks. Proceedings of the VLDB Endowment 9, 2 (2015), 48–59. DOI:Google ScholarDigital Library
[122] Henderson Keith and Eliassi-Rad Tina. 2009. Applying latent dirichlet allocation to group discovery in large graphs. In Proceedings of the 2009 ACM Symposium on Applied Computing 1Shin Sung Y. and Ossowski Sascha (Eds.), ACM, 1456–1461. DOI:Google ScholarDigital Library
[123] Hendrickson Bruce, Leland Robert W., and Driessche Rafael Van. 1996. Enhancing data locality by using terminal propagation. In Proceedings of the 29th Annual Hawaii International Conference on System Sciences. IEEE Computer Society, 565–574. DOI:Google ScholarCross Ref
[124] Henzinger Monika. 2018. The state of the art in dynamic graph algorithms. In Proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science. Springer, 40–44. DOI:Google ScholarCross Ref
[125] Henzinger Monika, Khan Shahbaz, Paul Richard, and Schulz Christian. 2020. Dynamic matching algorithms in practice, See Grandoni et al. [110], 58:1–58:20. DOI:Google ScholarCross Ref
[126] Henzinger Monika, Krinninger Sebastian, Nanongkai Danupon, and Saranurak Thatchaphol. 2015. Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing. 21–30. DOI:Google ScholarDigital Library
[127] Henzinger Monika, Lincoln Andrea, and Saha Barna. 2022. The complexity of average-case dynamic subgraph counting. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms. Naor Joseph (Seffi) and Buchbinder Niv (Eds.), SIAM, 459–498. DOI:Google ScholarCross Ref
[128] Henzinger Monika, Noe Alexander, and Schulz Christian. 2022. Practical fully dynamic minimum cut algorithms. In Proceedings of the Symposium on Algorithm Engineering and Experiments. Phillips Cynthia A. and Speckmann Bettina (Eds.), SIAM, 13–26. DOI:Google ScholarCross Ref
[129] Henzinger Monika, Paz Ami, and Schmid Stefan. 2021. On the complexity of weight-dynamic network algorithms. In Proceedings of the IFIP Networking Conference.Yan Zheng, Tyson Gareth, and Koutsonikolas Dimitrios (Eds.), IEEE, 1–9. DOI:Google ScholarCross Ref
[130] Henzinger Monika Rauch. 1995. Approximating minimum cuts under insertions. In Proceedings of the International Colloquium on Automata, Languages, and Programming. Springer, 280–291.Google ScholarCross Ref
[131] Henzinger Monika Rauch. 1995. Fully dynamic biconnectivity in graphs. Algorithmica 13, 6 (1995), 503–538. DOI:Google ScholarCross Ref
[132] Henzinger Monika Rauch. 2000. Improved data structures for fully dynamic biconnectivity. SIAM Journal on Computing 29, 6 (2000), 1761–1815. DOI:Google ScholarDigital Library
[133] Henzinger Monika Rauch and Fredman Michael L.. 1998. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica 22, 3 (1998), 351–362. DOI:Google ScholarCross Ref
[134] Henzinger Monika Rauch and King Valerie. 1995. Randomized dynamic graph algorithms with polylogarithmic time per operation. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing.Leighton Frank Thomson and Borodin Allan (Eds.), ACM, 519–527. DOI:Google ScholarDigital Library
[135] Henzinger Monika R. and King Valerie. 1997. Maintaining minimum spanning trees in dynamic graphs. In Proceedings of the International Colloquium on Automata, Languages, and Programming. Springer, 594–604.Google ScholarCross Ref
[136] Henzinger Monika Rauch and King Valerie. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of ACM 46, 4 (1999), 502–516. DOI:Google ScholarDigital Library
[137] Holm Jacob, Lichtenberg Kristian de, and Thorup Mikkel. 1998. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proceedings of the 13th Annual ACM Symposium on the Theory of Computing.Vitter Jeffrey Scott (Ed.), ACM, 79–89. DOI:Google ScholarDigital Library
[138] Holm Jacob, Lichtenberg Kristian de, and Thorup Mikkel. 2001. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of ACM 48, 4 (2001), 723–760. DOI:Google ScholarDigital Library
[139] Holm Jacob, Rotenberg Eva, and Wulff-Nilsen Christian. 2015. Faster fully-dynamic minimum spanning forest. In Proceedings of the 23rd Annual European Symposium,Bansal Nikhil and Finocchi Irene (Eds.), Vol. 9294. Springer, 742–753. DOI:Google ScholarCross Ref
[140] Hu Y. F. and Blake R. J.. 1999. An improved diffusion algorithm for dynamic load balancing. Parallel Computing 25, 4 (1999), 417–444. DOI:Google ScholarDigital Library
[141] Hua Qiang-Sheng, Shi Yuliang, Yu Dongxiao, Jin Hai, Yu Jiguo, Cai Zhipeng, Cheng Xiuzhen, and Chen Hanhua. 2020. Faster parallel core maintenance algorithms in dynamic graphs. IEEE International Conference on Distributed Computing Systems 31, 6 (2020), 1287–1300. DOI:Google ScholarDigital Library
[142] Huang Jiewen and Abadi Daniel. 2016. LEOPARD: Lightweight edge-oriented partitioning and replication for dynamic graphs. Proceedings of the VLDB Endowment 9, 7 (2016), 540–551. DOI:Google ScholarDigital Library
[143] Huang Shang-En, Huang Dawei, Kopelowitz Tsvi, and Pettie Seth. 2017. Fully dynamic connectivity in O(log n(log log n)\({}^{\mbox{2}}\)) amortized expected time. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms.Klein Philip N. (Ed.), SIAM, 510–520. DOI:Google ScholarCross Ref
[144] II Giuseppe Amato, Cattaneo Giuseppe, and Italiano Giuseppe F.. 1997. Experimental analysis of dynamic minimum spanning tree algorithms (extended abstract). In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms.Saks Michael E. (Ed.), ACM/SIAM, 314–323. Retrieved from http://dl.acm.org/citation.cfm?id=314161.314314.Google Scholar
[145] Italiano Giuseppe F.. 2016. Fully dynamic higher connectivity. In Proceedings of the Encyclopedia of Algorithms. 797–800. Google ScholarCross Ref
[146] Ivkovic Zoran and Lloyd Errol L.. 1993. Fully dynamic maintenance of vertex cover. In Proceedings of the 19th International Workshop Graph-Theoretic Concepts in Computer Science. 790. 99–111.Google Scholar
[147] Iwabuchi Keita, Sallinen Scott, Pearce Roger, Essen Brian Van, Gokhale Maya, and Matsuoka Satoshi. 2016. Towards a distributed large-scale dynamic graph data store. In Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops. IEEE, 892–901. DOI:Google ScholarCross Ref
[148] Iyer Raj, Karger David R., Rahul Hariharan, and Thorup Mikkel. 2001. An experimental study of polylogarithmic, fully dynamic, connectivity algorithms. ACM Journal of Experimental Algorithmics 6 (2001), 4. DOI:Google ScholarDigital Library
[149] Jin Hai, Wang Na, Yu Dongxiao, Hua Qiang-Sheng, Shi Xuanhua, and Xie Xia. 2018. Core maintenance in dynamic graphs: A parallel approach based on matching. IEEE International Conference on Distributed Computing Systems 29, 11 (2018), 2416–2428. DOI:Google ScholarDigital Library
[150] Jin Wenyu and Sun Xiaorui. 2021. Fully dynamic s-t edge connectivity in subpolynomial time. In Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science (FOCS’21), Denver, CO, USA, February 7-10, 2022, IEEE, 861–872. Google ScholarCross Ref
[151] Jowhari Hossein and Ghodsi Mohammad. 2005. New streaming algorithms for counting triangles in graphs. In Proceedings of the 11th Annual International Conference on Computing and Combinatorics,Wang Lusheng (Ed.), Vol. 3595. Springer, 710–716. DOI:Google ScholarCross Ref
[152] Kapron Bruce M., King Valerie, and Mountjoy Ben. 2013. Dynamic graph connectivity in polylogarithmic worst case time. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms.Khanna Sanjeev (Ed.), SIAM, 1131–1142. DOI:Google ScholarCross Ref
[153] Kara Ahmet, Ngo Hung Q., Nikolic Milos, Olteanu Dan, and Zhang Haozhe. 2019. Counting triangles under updates in worst-case optimal time. In Proceedings of the 22nd International Conference on Database Theory.Barceló Pablo and Calautti Marco (Eds.), Vol. 127. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 4:1–4:18. DOI:Google ScholarCross Ref
[154] Kara Ahmet, Ngo Hung Q., Nikolic Milos, Olteanu Dan, and Zhang Haozhe. 2020. Maintaining triangle queries under updates. ACM Transactions on Database Systems 45, 3 (2020), 11:1–11:46. DOI:Google ScholarDigital Library
[155] Kas Miray, Carley Kathleen M., and Carley L. Richard. 2013. Incremental closeness centrality for dynamically changing social networks. In Proceedings of the Advances in Social Networks Analysis and Mining. Rokne Jon G. and Faloutsos Christos (Eds.). ACM, 1250–1258. DOI:Google ScholarDigital Library
[156] Khan Shahbaz. 2019. Near optimal parallel algorithms for dynamic DFS in undirected graphs. ACM Transactions on Parallel Computing 6, 3 (2019), 18:1–18:33. DOI:Google ScholarDigital Library
[157] Kiefer Tim, Habich Dirk, and Lehner Wolfgang. 2016. Penalized graph partitioning for static and dynamic load balancing. In Proceedings of the 22nd International Conference on Parallel and Distributed Computing. Dutot Pierre-François and Trystram Denis (Eds.), Vol. 9833. Springer, 146–158. DOI:Google ScholarDigital Library
[158] King Valerie. 1999. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science.IEEE Computer Society, 81–91. DOI:Google ScholarCross Ref
[159] King Valerie and Thorup Mikkel. 2001. A space saving trick for directed dynamic transitive closure and shortest path algorithms. In Proceedings of the 7th Annual International Conference on Computing and Combinatorics.Wang Jie (Ed.), Vol. 2108. Springer, 268–277. DOI:Google ScholarCross Ref
[160] Kohli Pushmeet and Torr Philip H. S.. 2007. Dynamic graph cuts for efficient inference in Markov random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence 29, 12 (2007), 2079–2088. DOI:Google ScholarDigital Library
[161] Kohli Pushmeet and Torr Philip H. S.. 2010. Dynamic graph cuts and their applications in computer vision. In Proceedings of the Computer Vision: Detection, Recognition and Reconstruction, Cipolla Roberto, Battiato Sebastiano, and Farinella Giovanni Maria (Eds.), Studies in Computational Intelligence, Vol. 285. Springer, 51–108. DOI:Google ScholarCross Ref
[162] Kourtellis Nicolas, Morales Gianmarco De Francisci, and Bonchi Francesco. 2015. Scalable online betweenness centrality in evolving graphs. IEEE Transactions on Knowledge & Data Engineering 27, 9 (2015), 2494–2506. DOI:Google ScholarDigital Library
[163] Kourtellis Nicolas, Morales Gianmarco De Francisci, and Bonchi Francesco. 2016. Scalable online betweenness centrality in evolving graphs. In Proceedings of the 32nd IEEE International Conference on Data Engineering. IEEE Computer Society, 1580–1581. DOI:Google ScholarCross Ref
[164] Krommidas Ioannis and Zaroliagis Christos D.. 2008. An experimental study of algorithms for fully dynamic transitive closure. ACM Journal of Experimental Algorithmics 12 (2008), 1.6:1–1.6:22. DOI:Google ScholarDigital Library
[165] Kumar S. and Gupta P.. 2003. An incremental algorithm for the maximum flow problem. Journal of Mathematical Modelling and Algorithms 2, 1 (2003), 1–16. DOI:Google ScholarCross Ref
[166] Lee Min-Joong, Choi Sunghee, and Chung Chin-Wan. 2016. Efficient algorithms for updating betweenness centrality in fully dynamic graphs. Information Science 326 (2016), 278–296. DOI:Google ScholarDigital Library
[167] Lee Min-Joong, Lee Jungmin, Park Jaimie Yejean, Choi Ryan Hyun, and Chung Chin-Wan. 2012. QUBE: A quick algorithm for updating betweenness centrality. In Proceedings of the 21st World Wide Web Conference 2012Mille Alain, Gandon Fabien L., Misselis Jacques, Rabinovich Michael, and Staab Steffen (Eds.). ACM, 351–360. DOI:Google ScholarDigital Library
[168] Li Rong-Hua, Yu Jeffrey Xu, and Mao Rui. 2014. Efficient core maintenance in large dynamic graphs. IEEE Transactions on Knowledge and Data Engineering 26, 10 (2014), 2453–2465. DOI:Google ScholarCross Ref
[169] Lim Yongsub, Jung Minsoo, and Kang U.. 2018. Memory-efficient and accurate sampling for counting local triangles in graph streams: From simple to multigraphs. ACM Transactions on Knowledge Discovery from Data 12, 1 (2018), 4:1–4:28. DOI:Google ScholarDigital Library
[170] Lim Yongsub and Kang U.. 2015. MASCOT: Memory-efficient and accurate sampling for counting local triangles in graph streams. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Cao Longbing, Zhang Chengqi, Joachims Thorsten, Webb Geoffrey I., Margineantu Dragos D., and Williams Graham (Eds.), ACM, 685–694. DOI:Google ScholarDigital Library
[171] Lu Shangqi and Tao Yufei. 2021. Towards optimal dynamic indexes for approximate (and exact) triangle counting. In Proceedings of the 24th International Conference on Database Theory, ICDT 2021, March 23–26, 2021, Nicosia, Cyprus (LIPIcs), Yi Ke and Wei Zhewei (Eds.), Vol. 186. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1–6:23. DOI:Google ScholarCross Ref
[172] Madkour Amgad, Aref Walid G., Rehman Faizan Ur, Rahman Mohamed Abdur, and Basalamah Saleh. 2017. A survey of shortest-path algorithms. arXiv:1705.02044. Retrieved from https://arxiv.org/abs/1705.02044.Google Scholar
[173] Makkar Devavret, Bader David A., and Green Oded. 2017. Exact and parallel triangle counting in dynamic graphs. In Proceedings of the 24th IEEE International Conference on High Performance Computing, HiPC 2017, Jaipur, India, December 18–21, 2017. IEEE Computer Society, 2–12. DOI:Google ScholarCross Ref
[174] Marchetti-Spaccamela Alberto, Nanni Umberto, and Rohnert Hans. 1996. Maintaining a topological order under edge insertions. Information Processing Letters 59, 1 (1996), 53–58. DOI:Google ScholarDigital Library
[175] Meyerhenke Henning. 2009. Dynamic load balancing for parallel numerical simulations based on repartitioning with disturbed diffusion. In Proceedings of the 15th International Conference on Parallel and Distributed Systems. IEEE, 150–157. DOI:Google ScholarDigital Library
[176] Meyerhenke Henning and Gehweiler Joachim. 2010. On dynamic graph partitioning and graph clustering using diffusion. In Proceedings of the Algorithm Engineering, 27.06.–02.07.2010 (Dagstuhl Seminar Proc.), Italiano Giuseppe F., Johnson David S., Mutzel Petra, and Sanders Peter (Eds.), Vol. 10261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. Retrieved from http://drops.dagstuhl.de/opus/volltexte/2010/2798/.Google Scholar
[177] Miller Kurt T. and Eliassi-Rad Tina. 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.Google Scholar
[178] Miltersen Peter Bro, Subramanian Sairam, Vitter Jeffrey Scott, and Tamassia Roberto. 1994. Complexity models for incremental computation. Theoretical Computer Science 130, 1 (1994), 203–236. DOI:Google ScholarDigital Library
[179] Miorandi Daniele and Pellegrini Francesco De. 2010. K-shell decomposition for dynamic complex networks, See Ariel Orda [19], 488–496. Retrieved from http://ieeexplore.ieee.org/document/5520231/.Google Scholar
[180] Misra Sudip and Oommen B. John. 2005. Dynamic algorithms for the shortest path routing problem: Learning automata-based solutions. IEEE Transactions on Systems, Man, and Cybernetics Part B 35, 6 (2005), 1179–1192. DOI:Google ScholarDigital Library
[181] Mukherjee Kingshuk, Hasan Md Mahmudul, Boucher Christina, and Kahveci Tamer. 2018. Counting motifs in dynamic networks. BMC Systems Biology 12, 1 (2018), 1–12. DOI:Google ScholarCross Ref
[182] Nakamura Kengo and Sadakane Kunihiko. 2019. Space-efficient fully dynamic DFS in undirected graphs. Algorithms 12, 3 (2019), 52. DOI:Google ScholarCross Ref
[183] Narváez Paolo, Siu Kai-Yeung, and Tzeng Hong-Yi. 2000. New dynamic algorithms for shortest path tree computation. IEEE/ACM Transactions on Networking 8, 6 (2000), 734–746. DOI:Google ScholarDigital Library
[184] Narváez Paolo, Siu Kai-Yeung, and Tzeng Hong-Yi. 2001. New dynamic SPT algorithm based on a ball-and-string model. IEEE/ACM Transactions on Networking 9, 6 (2001), 706–718. DOI:Google ScholarDigital Library
[185] Nasre Meghana, Pontecorvi Matteo, and Ramachandran Vijaya. 2014. Betweenness centrality - incremental and faster. In Proceedings of the Mathematical Foundations of Computer Science 2014-39th International Symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II (Lecture Notes in Computer Science), Csuhaj-Varjú Erzsébet, Dietzfelbinger Martin, and Ésik Zoltán (Eds.), Vol. 8635. Springer, 577–588. DOI:Google ScholarCross Ref
[186] Nathan Eisha and Bader David A.. 2017. Approximating personalized katz centrality in dynamic graphs. In Proceedings of the Parallel Processing and Applied Mathematics - 12th International Conference, PPAM 2017, Lublin, Poland, September 10-13, 2017, Revised Selected Papers, Part I (Lecture Notes in Computer Science), Wyrzykowski Roman, Dongarra Jack J., Deelman Ewa, and Karczewski Konrad (Eds.), Vol. 10777. Springer, 290–302. DOI:Google ScholarCross Ref
[187] Nathan Eisha and Bader David A.. 2017. A dynamic algorithm for updating katz centrality in graphs, See Diesner et al. [82], 149–154. DOI:Google ScholarDigital Library
[188] Neiman Ofer and Solomon Shay. 2016. Simple deterministic algorithms for fully dynamic maximal matching. ACM Transactions on Algorithms 12, 1 (2016), 7:1–7:15. DOI:Google ScholarDigital Library
[189] Newman M. E. J. and Girvan M.. 2004. Finding and evaluating community structure in networks. Physical Review E 69, 2 (2004), 026113. DOI:Google ScholarCross Ref
[190] Nicoara Daniel, Kamali Shahin, Daudjee Khuzaima, and Chen Lei. 2015. Hermes: Dynamic partitioning for distributed social network graph databases. In Proceedings of the EDBT. 25–36. DOI:Google ScholarCross Ref
[191] Onak Krzysztof and Rubinfeld Ronitt. 2010. Maintaining a large matching and a small vertex cover. In Proceedings of the STOC. 457–464. DOI:Google ScholarDigital Library
[192] Orlin James B.. 2013. Max flows in \(O(nm)\) time, or better. In Proceedings of the Symposium on Theory of Computing Conference, STOC’13, Palo Alto, CA, USA, June 1–4, 2013, Boneh Dan, Roughgarden Tim, and Feigenbaum Joan (Eds.), ACM, 765–774. DOI:Google ScholarDigital Library
[193] Patrascu Mihai. 2010. Towards polynomial lower bounds for dynamic problems. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC. ACM, 603–610. DOI:Google ScholarDigital Library
[194] Patrascu Mihai and Demaine Erik D.. 2006. Logarithmic lower bounds in the cell-probe model. SIAM Journal on Computing 35, 4 (2006), 932–963. DOI:Google ScholarDigital Library
[195] Pavan A., Tangwongsan Kanat, Tirthapura Srikanta, and Wu Kun-Lung. 2013. Counting and sampling triangles from a graph stream. Proceedings of the VLDB Endowment 6, 14 (2013), 1870–1881. DOI:Google ScholarDigital Library
[196] Pearce D. and Kelly P.. 2010. A batch algorithm for maintaining a topological order. In Proceedings of the ACSC. DOI:Google ScholarDigital Library
[197] Pearce David J. and Kelly Paul H. J.. 2004. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25–28, 2004, Proc. (Lecture Notes in Computer Science), Ribeiro Celso C. and Martins Simone L. (Eds.), Vol. 3059. Springer, 383–398. DOI:Google ScholarCross Ref
[198] Pearce David J. and Kelly Paul H. J.. 2006. A dynamic topological sort algorithm for directed acyclic graphs. ACM Journal of Experimental Algorithmics 11 (2006). DOI:Google ScholarDigital Library
[199] Pearce David J., Kelly Paul H. J., and Hankin Chris. 2004. Online cycle detection and difference propagation: Applications to pointer analysis. Software Quality Journal 12, 4 (2004), 311–337. DOI:Google ScholarDigital Library
[200] Pons Reynaldo Gil. 2018. Space efficient incremental betweenness algorithm for directed graphs. In Proceedings of the Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 23rd Iberoamerican Congress, CIARP 2018, Madrid, Spain, November 19–22, 2018, Proc. (Lecture Notes in Computer Science), Vera-Rodríguez Rubén, Fiérrez Julian, and Morales Aythami (Eds.), Vol. 11401. Springer, 262–270. DOI:Google ScholarCross Ref
[201] Pontecorvi Matteo and Ramachandran Vijaya. 2015. Fully dynamic betweenness centrality. In Proceedings of the 26th International Symposium on Algorithms and Computation, Nagoya, Japan, December 9–11, 2015, Proceedings (Lecture Notes in Computer Science), Elbassioni Khaled M. and Makino Kazuhisa (Eds.), Vol. 9472. Springer, 331–342. DOI:Google ScholarCross Ref
[202] Putman K. (Lynn), Boekhout Hanjo D., and Takes Frank W.. 2019. Fast incremental computation of harmonic closeness centrality in directed weighted networks. In Proceedings of theASONAM’19: International Conference on Advances in Social Networks Analysis and Mining, Vancouver, British Columbia, Canada, 27–30 August, 2019, Spezzano Francesca, Chen Wei, and Xiao Xiaokui (Eds.). ACM, 1018–1025. DOI:Google ScholarDigital Library
[203] Pyrga Evangelia, Schulz Frank, Wagner Dorothea, and Zaroliagis Christos D.. 2007. Efficient models for timetable information in public transportation systems. ACM Journal of Experimental Algorithmics 12 (2007), 2.4:1–2.4:39. DOI:Google ScholarDigital Library
[204] Ramalingam G. and Reps Thomas. 1991. On the Computational Complexity of Incremental Algorithms. Technical Report. University of Wisconsin-Madison Department of Computer Sciences.Google Scholar
[205] Ramalingam G. and Reps Thomas W.. 1996. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms 21, 2 (1996), 267–305. DOI:Google ScholarDigital Library
[206] Ramalingam G. and Reps Thomas W.. 1996. On the computational complexity of dynamic graph problems. Theoretical Computer Science 158, 1&2 (1996), 233–277. DOI:Google ScholarDigital Library
[207] Ribeiro Celso C. and Toso Rodrigo F.. 2007. Experimental analysis of algorithms for updating minimum spanning trees on graphs subject to changes on edge weights, See Demetrescu [77], 393–405. DOI:Google ScholarCross Ref
[208] Riondato Matteo and Kornaropoulos Evgenios M.. 2014. Fast approximation of betweenness centrality through sampling. In Proceedings of the 7th ACM International Conference on Web Search and Data Mining, WSDM 2014, New York, NY, USA, February 24–28, 2014, Carterette Ben, Diaz Fernando, Castillo Carlos, and Metzler Donald (Eds.), ACM, 413–422. DOI:Google ScholarDigital Library
[209] Roditty Liam. 2008. A faster and simpler fully dynamic transitive closure. ACM Transactions on Algorithms 4, 1 (2008), 6:1–6:16. DOI:Google ScholarDigital Library
[210] Roditty Liam and Zwick Uri. 2011. On dynamic shortest paths problems. Algorithmica 61, 2 (2011), 389–401. DOI:Google ScholarDigital Library
[211] Roditty Liam and Zwick Uri. 2012. Dynamic approximate all-pairs shortest paths in undirected graphs. SIAM Journal on Computing 41, 3 (2012), 670–683. DOI:Google ScholarDigital Library
[212] Roditty Liam and Zwick Uri. 2016. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. SIAM Journal on Computing 45, 3 (2016), 712–733. DOI:Google ScholarDigital Library
[213] Roghani Mohammad, Saberi Amin, and Wajc David. 2022. Beating the folklore algorithm for dynamic matching. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA (LIPIcs), Braverman Mark (Ed.), Vol. 215. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 111:1–111:23. DOI:Google ScholarCross Ref
[214] Rossetti Giulio and Cazabet Rémy. 2018. Community discovery in dynamic networks: A survey. ACM Computing Surveys 51, 2 (2018), 35:1–35:37. DOI:Google ScholarDigital Library
[215] Rotaru Tiberiu and Nägeli Hans-Heinrich. 2004. Dynamic load balancing by diffusion in heterogeneous systems. Journal of Parallel and Distributed Computing 64, 4 (2004), 481–497. DOI:Google ScholarDigital Library
[216] Sakouhi Chayma, Aridhi Sabeur, Guerrieri Alessio, Sassi Salma, and Montresor Alberto. 2016. DynamicDFEP: A distributed edge partitioning approach for large dynamic graphs. In Proceedings of the 20th International Database Engineering & Applications Symposium, IDEAS 2016, Montreal, QC, Canada, July 11–13, 2016, Desai Evan, Desai Bipin C., Toyama Motomichi, and Bernardino Jorge (Eds.). ACM, 142–147. DOI:Google ScholarDigital Library
[217] Sankowski Piotr. 2004. Dynamic transitive closure via dynamic matrix inverse (extended abstract). In Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 17–19 October 2004, Rome, Italy, Proc.IEEE Computer Society, 509–517. DOI:Google ScholarDigital Library
[218] Sankowski Piotr. 2005. Subquadratic algorithm for dynamic shortest distances. In Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON 2005, Kunming, China, August 16–29, 2005, Proceedings (Lecture Notes in Computer Science), Wang Lusheng (Ed.), Vol. 3595. Springer, 461–470. DOI:Google ScholarCross Ref
[219] Sankowski Piotr. 2007. Faster dynamic matchings and vertex connectivity. In Proceedings of the SODA. 118–126. DOI:Google ScholarCross Ref
[220] Sariyüce Ahmet Erdem, Gedik Bugra, Jacques-Silva Gabriela, Wu Kun-Lung, and Çatalyürek Ümit V.. 2016. Incremental k-core decomposition: Algorithms and evaluation. VLDB Journal 25, 3 (2016), 425–447. DOI:Google ScholarDigital Library
[221] Sariyüce Ahmet Erdem, Kaya Kamer, Saule Erik, and Çatalyürek Ümit V.. 2013. Incremental algorithms for closeness centrality. In Proceedings of the 2013 IEEE International Conference on Big Data, 6–9 October 2013, Santa Clara, CA, USA, Hu Xiaohua, Lin Tsau Young, Raghavan Vijay V., Wah Benjamin W., Baeza-Yates Ricardo, Fox Geoffrey C., Shahabi Cyrus, Smith Matthew, Yang Qiang, Ghani Rayid, Fan Wei, Lempel Ronny, and Nambiar Raghunath (Eds.). IEEE Computer Society, 487–492. DOI:Google ScholarCross Ref
[222] Sariyüce Ahmet Erdem, Saule Erik, Kaya Kamer, and Çatalyürek Ümit V.. 2013. STREAMER: A distributed framework for incremental closeness centrality computation. In Proceedings of the 2013 IEEE International Conference on Cluster Computing, CLUSTER 2013, Indianapolis, IN, USA, September 23–27, 2013. IEEE Computer Society, 1–8. DOI:Google ScholarCross Ref
[223] Sariyüce Ahmet Erdem, Saule Erik, Kaya Kamer, and Çatalyürek Ümit V.. 2015. Incremental closeness centrality in distributed memory. Parallel Computing 47 (2015), 3–18. DOI:Google ScholarDigital Library
[224] Schiller Benjamin, Jager Sven, Hamacher Kay, and Strufe Thorsten. 2015. StreaM - A stream-based algorithm for counting motifs in dynamic graphs. In Proceedings of the 2nd International Conference on Algorithms for Computational Biology, AlCoB 2015, Mexico City, Mexico, August 4–5, 2015, Proc. (Lecture Notes in Computer Science), Dediu Adrian-Horia, Quiroz Francisco Hernández, Martín-Vide Carlos, and Rosenblueth David A. (Eds.), Vol. 9199. Springer, 53–67. DOI:Google ScholarDigital Library
[225] Schloegel Kirk, Karypis George, and Kumar Vipin. 1997. Multilevel diffusion schemes for repartitioning of adaptive meshes. Journal of Parallel and Distributed Computing 47, 2 (1997), 109–124. DOI:Google ScholarDigital Library
[226] Schloegel Kirk, Karypis George, and Kumar Vipin. 2000. A unified algorithm for load-balancing adaptive scientific simulations. In Proceedings of the Supercomputing 2000, November 4–10, 2000, Dallas, Texas, USA. IEEE Computer Society, CD-ROM, Donnelley Jed (Ed.). IEEE Computer Society, 59. DOI:Google ScholarCross Ref
[227] Schloegel Kirk, Karypis George, and Kumar Vipin. 2002. Parallel static and dynamic multi-constraint graph partitioning. Concurrency and Computation: Practice and Experience 14, 3 (2002), 219–240. DOI:Google ScholarCross Ref
[228] Schultes Dominik and Sanders Peter. 2007. Dynamic highway-node routing, See Demetrescu [77], 66–79. DOI:Google ScholarCross Ref
[229] Sengupta Dipanjan, Sundaram Narayanan, Zhu Xia, Willke Theodore L., Young Jeffrey, Wolf Matthew, and Schwan Karsten. 2016. Graphin: An online high performance incremental graph processing framework. In Proceedings of the European Conference on Parallel Processing. Springer, 319–333. DOI:Google ScholarDigital Library
[230] Sengupta Neha, Hamann Michael, and Wagner Dorothea. 2017. Benchmark generator for dynamic overlapping communities in networks. In Proceedings of the 2017 IEEE International Conference on Data Mining, ICDM 2017, New Orleans, LA, USA, November 18–21, 2017, Raghavan Vijay, Aluru Srinivas, Karypis George, Miele Lucio, and Wu Xindong (Eds.). IEEE Computer Society, 415–424. DOI:Google ScholarCross Ref
[231] Shao Zhenzhen, Guo Na, Gu Yu, Wang Zhigang, Li Fangfang, and Yu Ge. 2020. Efficient closeness centrality computation for dynamic graphs. In Proceedings of the 25th International Conference on Database Systems for Advanced Applications, DASFAA 2020, Jeju, South Korea, September 24–27, 2020, Proc., Part II (Lecture Notes in Computer Science), Nah Yunmook, Cui Bin, Lee Sang-Won, Yu Jeffrey Xu, Moon Yang-Sae, and Whang Steven Euijong (Eds.), Vol. 12113. Springer, 534–550. DOI:Google ScholarDigital Library
[232] Shiloach Y. and Even S.. 1981. An on-line edge-deletion problem. Journal of ACM 28, 1 (1981), 1–4. DOI:Google ScholarDigital Library
[233] Singh Dhirendra and Khare Nilay. 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–225. Retrieved from http://iajit.org/index.php?option=com_content&task=blogcategory&id=137&Itemid=469.Google Scholar
[234] Sleator Daniel Dominic and Tarjan Robert Endre. 1981. A data structure for dynamic trees. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, May 11–13, 1981, Milwaukee, Wisconsin, USA. ACM, 114–122. DOI:Google ScholarDigital Library
[235] Solomon Shay. 2016. Fully dynamic maximal matching in constant update time. In Proceedings of the 57th Symposium on Foundations of Computer Science FOCS. 325–334. DOI:Google ScholarCross Ref
[236] Stefani Lorenzo De, Epasto Alessandro, Riondato Matteo, and Upfal Eli. 2017. TRIÈST: Counting local and global triangles in fully dynamic streams with fixed memory size. ACM Transactions on Knowledge Discovery from Data 11, 4 (2017), 43:1–43:50. DOI:Google ScholarDigital Library
[237] Stubbs Daniel and Williams Virginia Vassilevska. 2017. Metatheorems for dynamic weighted matching. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9–11, 2017, Berkeley, CA, USA (LIPIcs), Papadimitriou Christos H. (Ed.), Vol. 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 58:1–58:14. DOI:Google ScholarCross Ref
[238] Sun Bintao, Chan T.-H. Hubert, and Sozio Mauro. 2020. Fully dynamic approximate k-core decomposition in hypergraphs. ACM Transactions on Knowledge Discovery from Data 14, 4, Article 39 (May2020), 21 pages. DOI:Google ScholarDigital Library
[239] Tarjan Robert Endre and Werneck Renato Fonseca F.. 2009. Dynamic trees in practice. ACM Journal of Experimental Algorithmics 14 (2009). DOI:Google ScholarDigital Library
[240] Thorup Mikkel. 2004. Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8–10, 2004, Proceedings (Lecture Notes in Computer Science), Hagerup Torben and Katajainen Jyrki (Eds.), Vol. 3111. Springer, 384–396. DOI:Google ScholarCross Ref
[241] Thorup Mikkel. 2005. Worst-case update times for fully-dynamic all-pairs shortest paths. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22–24, 2005, Gabow Harold N. and Fagin Ronald (Eds.). ACM, 112–119. DOI:Google ScholarDigital Library
[242] Thorup Mikkel. 2007. Fully-dynamic min-cut. Combinatorica 27, 1 (2007), 91–127. DOI:Google ScholarDigital Library
[243] Thorup Mikkel and Karger David R.. 2000. Dynamic graph algorithms with applications. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5–7, 2000, Proceedings (Lecture Notes in Computer Science), Halldórsson Magnús M. (Ed.), Vol. 1851. Springer, 1–9. DOI:Google ScholarCross Ref
[244] Tseng Thomas, Dhulipala Laxman, and Blelloch Guy E.. 2019. Batch-parallel euler tour trees. In Proceedings of the 21st Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7–8, 2019, Kobourov Stephen G. and Meyerhenke Henning (Eds.), SIAM, 92–106. DOI:Google ScholarCross Ref
[245] Brand Jan van den and Nanongkai Danupon. 2019. Dynamic approximate shortest paths and beyond: Subquadratic and worst-case update time. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9–12, 2019, Zuckerman David (Ed.). IEEE Computer Society, 436–455. DOI:Google ScholarCross Ref
[246] Brand Jan van den, Nanongkai Danupon, and Saranurak Thatchaphol. 2019. Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9–12, 2019, Zuckerman David (Ed.). IEEE Computer Society, 456–480. DOI:Google ScholarCross Ref
[247] Grinten Alexander van der, Bergamini Elisabetta, Green Oded, Bader David A., and Meyerhenke Henning. 2018. Scalable katz ranking computation in large static and dynamic graphs. In Proceedings of the 26th Annual European Symposium on Algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland (LIPIcs), Azar Yossi, Bast Hannah, and Herman Grzegorz (Eds.), Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 42:1–42:14. DOI:Google ScholarCross Ref
[248] Vaquero Luis M., Cuadrado Félix, Logothetis Dionysios, and Martella Claudio. 2013. xDGP: A dynamic graph processing system with adaptive partitioning. arXiv:1309.1049. http://arxiv.org/abs/1309.1049.Google Scholar
[249] Vaquero Luis M., Cuadrado Félix, Logothetis Dionysios, and Martella Claudio. 2014. Adaptive partitioning for large-scale dynamic graphs. In Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, ICDCS 2014, Madrid, Spain, June 30 – July 3, 2014. IEEE Computer Society, 144–153. DOI:Google ScholarCross Ref
[250] Verma Tanmay and Batra Dhruv. 2012. MaxFlow revisited: An empirical comparison of maxflow algorithms for dense vision problems. In Proceedingds of the British Machine Vision Conference, BMVC 2012, Surrey, UK, September 3–7, 2012, Bowden Richard, Collomosse John P., and Mikolajczyk Krystian (Eds.). BMVA Press, 1–12. DOI:Google ScholarCross Ref
[251] Wagner Dorothea, Willhalm Thomas, and Zaroliagis Christos D.. 2005. Geometric containers for efficient shortest-path computation. ACM Journal of Experimental Algorithmics 10 (2005). DOI:Google ScholarDigital Library
[252] Walshaw Chris, Cross Mark, and Everett Martin G.. 1997. Parallel dynamic graph partitioning for adaptive unstructured meshes. Journal of Parallel and Distributed Computing 47, 2 (1997), 102–108. DOI:Google ScholarDigital Library
[253] Wang Na, Yu Dongxiao, Jin Hai, Qian Chen, Xie Xia, and Hua Qiang-Sheng. 2017. Parallel algorithm for core maintenance in dynamic graphs. In Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, ICDCS 2017, Atlanta, GA, USA, June 5–8, 2017, Lee Kisung and Liu Ling (Eds.). IEEE Computer Society, 2366–2371. DOI:Google ScholarCross Ref
[254] Weigert Stefan, Hiltunen Matti, and Fetzer Christof. 2011. Mining large distributed log data in near real time. In Proceedings of the Managing Large-scale Systems via the Analysis of System Logs and the Application of Machine Learning Techniques. 1–8. DOI:Google ScholarDigital Library
[255] Winter Martin, Mlakar Daniel, Zayer Rhaleb, Seidel Hans-Peter, and Steinberger Markus. 2018. faimGraph: High performance management of fully-dynamic graphs under tight memory constraints on the GPU. In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, SC 2018, Dallas, TX, USA, November 11–16, 2018. IEEE / ACM, 60:1–60:13. Retrieved from http://dl.acm.org/citation.cfm?id=3291736.Google ScholarDigital Library
[256] Xu Ning, Chen Lei, and Cui Bin. 2014. LogGP: A log-based dynamic graph partitioning method. Proceedings of the VLDB Endowment 7, 14 (2014), 1917–1928. DOI:Google ScholarDigital Library
[257] Yang Bohua, Wen Dong, Qin Lu, Zhang Ying, Wang Xubo, and Lin Xuemin. 2019. Fully dynamic depth-first search in directed graphs. Proceedings of the VLDB Endowment 13, 2 (2019), 142–154. DOI:Google ScholarDigital Library
[258] Yen Chia-Chen, Yeh Mi-Yen, and Chen Ming-Syan. 2013. An efficient approach to updating closeness centrality and average path length in dynamic networks. In Proceedings of the 2013 IEEE 13th International Conference on Data Mining, Dallas, TX, USA, December 7–10, 2013, Xiong Hui, Karypis George, Thuraisingham Bhavani M., Cook Diane J., and Wu Xindong (Eds.). IEEE Computer Society, 867–876. DOI:Google ScholarCross Ref
[259] Zakrzewska Anita and Bader David A.. 2016. Fast incremental community detection on dynamic graphs. In Proceedings of the Parallel Processing and Applied Mathematics, Wyrzykowski Roman, Deelman Ewa, Dongarra Jack, Karczewski Konrad, Kitowski Jacek, and Wiatr Kazimierz (Eds.). Springer International Publishing, Cham, 207–217. DOI:Google ScholarCross Ref
[260] Zaroliagis Christos D.. 2002. Implementations and experimental studies of dynamic graph algorithms. In Proceedings of the Experimental algorithmics. Springer, 229–278. DOI:Google ScholarCross Ref
[261] Zhang Yikai, Yu Jeffrey Xu, Zhang Ying, and Qin Lu. 2017. A fast order-based approach for core maintenance. In Proceedings of the 33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, CA, USA, April 19–22, 2017. IEEE Computer Society, 337–348. DOI:Google ScholarCross Ref
[262] Zheng Weiguo, Piao Chengzhi, Cheng Hong, and Yu Jeffrey Xu. 2019. Computing a near-maximum independent set in dynamic graphs. In Proceedings of the 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8–11, 2019. IEEE, 76–87. DOI:Google ScholarCross Ref
[263] Zheng Weiguo, Wang Qichen, Yu Jeffrey Xu, Cheng Hong, and Zou Lei. 2018. Efficient computation of a near-maximum independent set over evolving graphs. In Proceedings of the 34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16–19, 2018. IEEE Computer Society, 869–880. DOI:Google ScholarCross Ref
[264] Zhu Lei, Pang Shaoning, Sarrafzadeh Abdolhossein, Ban Tao, and Inoue Daisuke. 2016. Incremental and decremental max-flow for online semi-supervised learning. IEEE Transactions on Knowledge and Data Engineering 28, 8 (2016), 2115–2127. DOI:Google ScholarDigital Library
[265] Zhuang Di, Chang Morris J., and Li Mingchen. 2019. DynaMo: Dynamic community detection by incrementally maximizing modularity. IEEE Transactions on Knowledge and Data Engineering 33, 5 (2019), 1934–1945. DOI:Google ScholarCross Ref
[266] Zuckerman David (Ed.). 2019. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9–12, 2019. IEEE Computer Society. Retrieved from https://ieeexplore.ieee.org/xpl/conhome/8936052/proceeding.Google Scholar

Index Terms

Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide

Recommendations

Arboricity, h-index, and dynamic algorithms

We propose a new data structure for manipulating graphs, called h-graph, which is particularly suited for designing dynamic algorithms. The structure itself is simple, consisting basically of a triple of elements, for each vertex of the graph. The ...
Read More
Fully dynamic randomized algorithms for graph spanners

Spanner of an undirected graph G = (V,E) is a subgraph that is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with stretch t ∈ ℕ is a subgraph (V,E_S), E_S ⊆ E such that the distance between any two vertices in the ...
Read More
A faster algorithm for computing the girth of planar and bounded genus graphs

The girth of a graph G is the length of a shortest cycle of G. In this article we design an O(n^5/4 log n) algorithm for finding the girth of an undirected n-vertex planar graph, the first o(n²) algorithm for this problem. We also extend our results for ...
Read More

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Published in

ACM Journal of Experimental Algorithmics Volume 27, Issue
December 2022
776 pages
ISSN:1084-6654
EISSN:1084-6654
DOI:10.1145/3505192
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
- Published: 13 December 2022
- Online AM: 12 August 2022
- Accepted: 2 August 2022
- Revised: 8 March 2022
- Received: 1 July 2021
Published in jea Volume 27, Issue
Author Tags
Dynamic algorithms
graph algorithms
Qualifiers
- research-article
- Refereed
Conference
Funding Sources
Other Metrics
View Article Metrics

Article Metrics
- 5
  Total Citations
  View Citations
- 1,069
  Total Downloads
- Downloads (Last 12 months)535
- Downloads (Last 6 weeks)76
Other Metrics
View Author Metrics
Cited By
View all

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Full Text

View this article in Full Text.

View Full Text

HTML Format

View this article in HTML Format .

View HTML Format

Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide

ACM Journal of Experimental Algorithmics

Abstract

REFERENCES

Cited By

Index Terms

Recommendations

Arboricity, h-index, and dynamic algorithms

Fully dynamic randomized algorithms for graph spanners

A faster algorithm for computing the girth of planar and bounded genus graphs

Comments

Login options

Full Access

Published in

Sponsors

In-Cooperation

Publisher

Publication History

Author Tags

Qualifiers

Conference

Funding Sources

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF Format

eReader

Digital Edition

Full Text

HTML Format

Caption

Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide

ACM Journal of Experimental Algorithmics

Abstract

REFERENCES

Cited By

Index Terms

Recommendations

Arboricity, h-index, and dynamic algorithms

Fully dynamic randomized algorithms for graph spanners

A faster algorithm for computing the girth of planar and bounded genus graphs

Comments

Login options

Full Access

Published in

Sponsors

In-Cooperation

Publisher

Publication History

Author Tags

Qualifiers

Conference

Funding Sources

Article Metrics

Other Metrics

PDF Format

eReader

Digital Edition

Full Text

HTML Format

Share this Publication link

Share on Social Media