Recent advances in fully dynamic graph algorithms
Hanauer K, Henzinger MH, Schulz C. 2022. Recent advances in fully dynamic graph algorithms. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 1.
Download (ext.)
Conference Paper
| Published
| English
Scopus indexed
Author
Hanauer, Kathrin;
Henzinger, MonikaISTA 
;
Schulz, Christian
;
Schulz, ChristianSeries Title
LIPIcs
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.
Publishing Year
Date Published
2022-04-29
Proceedings Title
1st Symposium on Algorithmic Foundations of Dynamic Networks
Volume
221
Article Number
1
Conference
SAND: Symposium on Algorithmic Foundations of Dynamic Networks
Conference Location
Virtual
Conference Date
2022-03-28 – 2022-03-30
ISBN
eISSN
IST-REx-ID
Cite this
Hanauer K, Henzinger MH, Schulz C. Recent advances in fully dynamic graph algorithms. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.1
Hanauer, K., Henzinger, M. H., & Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.1
Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.1.
K. Hanauer, M. H. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
Hanauer K, Henzinger MH, Schulz C. 2022. Recent advances in fully dynamic graph algorithms. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 1.
Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.1.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
Export
Marked PublicationsOpen Data ISTA Research Explorer
Sources
arXiv 2102.11169
Google Scholar
ISBN Search