Recent Advances in Fully Dynamic Graph Algorithms

TL;DR

This paper reviews recent theoretical and engineering advances in fully dynamic graph algorithms, highlighting the gap between theoretical developments and practical implementation on real datasets.

Contribution

It provides a comprehensive reference guide summarizing recent progress in both the theory and engineering of fully dynamic graph algorithms.

Findings

Many algorithms remain unimplemented and untested on real data

Recent theoretical results have limited practical evaluation

The paper bridges the gap between theory and practice in the field

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.