Recent Advances in Fully Dynamic Graph Algorithms: A Quick Reference Guide

Kathrin Hanauer, Monika Henzinger, Christian Schulz

Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

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.
OriginalspracheEnglisch
Aufsatznummer1.11
Seiten (von - bis)1-45
Seitenumfang45
FachzeitschriftJournal of Experimental Algorithmics
Jahrgang27
Ausgabenummer11
DOIs
PublikationsstatusVeröffentlicht - 13 Dez. 2022

ÖFOS 2012

  • 102031 Theoretische Informatik

Fingerprint

Untersuchen Sie die Forschungsthemen von „Recent Advances in Fully Dynamic Graph Algorithms: A Quick Reference Guide“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitationsweisen