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.
@article{arxiv.2102.11169,
title = {Recent Advances in Fully Dynamic Graph Algorithms},
author = {Kathrin Hanauer and Monika Henzinger and Christian Schulz},
journal= {arXiv preprint arXiv:2102.11169},
year = {2022}
}