Recent Advances in Fully Dynamic Graph Algorithms

02/22/2021
by   Kathrin Hanauer, et al.
0

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 survey recent engineering and theory results in the area of fully dynamic graph algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2020

Dynamic Matching Algorithms in Practice

In recent years, significant advances have been made in the design and a...
research
12/23/2020

Recent Advances in Practical Data Reduction

Over the last two decades, significant advances have been made in the de...
research
05/26/2022

More Recent Advances in (Hyper)Graph Partitioning

In recent years, significant advances have been made in the design and e...
research
06/30/2020

A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization

The theory of evolutionary computation for discrete search spaces has ma...
research
11/02/2020

Recent Advances on the Graph Isomorphism Problem

We give an overview of recent advances on the graph isomorphism problem....
research
08/10/2021

Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice?

Fully dynamic graph algorithms that achieve polylogarithmic or better ti...
research
07/31/2019

Graph Space Embedding

We propose the Graph Space Embedding (GSE), a technique that maps the in...

Please sign up or login with your details

Forgot password? Click here to reset