mlsanityData to 7 Oct 2026

Recent Advances in Fully Dynamic Graph Algorithms

arXiv 2102.11169 ↗First posted 22 Feb 2021cs.DScited by 5

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Feb 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 3; 2026: 1.

5 papers.