Recent Advances in Fully Dynamic Graph Algorithms
arXiv:2102.11169
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.
References in corpus (10)
- Finding and evaluating community structure in networks
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
- Parallel Batch-Dynamic Graph Connectivity
- A Survey of Shortest-Path Algorithms
- xDGP: A Dynamic Graph Processing System with Adaptive Partitioning
- Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics
- Simple dynamic algorithms for Maximal Independent Set and other problems
- Faster Algorithms for Online Topological Ordering
- Parallel Batch-dynamic Trees via Change Propagation