2026-07-22T14:05:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15943 2023-05-03T15:04:09Z ddc:004 open_access

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk) Hanauer, Kathrin Henzinger, Monika Schulz, Christian fully dynamic graph algorithms survey 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. Schloss-Dagstuhl - Leibniz Zentrum für Informatik Kathrin Hanauer and Monika Henzinger and Christian Schulz 2022 Is Part Of LIPIcs, Volume 221, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SAND.2022.1 urn:nbn:de:0030-drops-159434 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.1 eng https://creativecommons.org/licenses/by/4.0/legalcode