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

Kathrin Hanauer; Monika Henzinger; Christian Schulz

doi:https://doi.org/10.1145/3555806

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

Kathrin Hanauer, Monika Henzinger, Christian Schulz

Research Group Theory and Applications of Algorithms

Publications: Contribution to journal › Article › Peer 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.

Original language	English
Article number	1.11
Pages (from-to)	1-45
Number of pages	45
Journal	Journal of Experimental Algorithmics
Volume	27
Issue number	11
DOIs	https://doi.org/10.1145/3555806
Publication status	Published - 13 Dec 2022

Austrian Fields of Science 2012

102031 Theoretical computer science

Keywords

Dynamic algorithms
graph algorithms

Access to Document

https://doi.org/10.1145/3555806

Cite this

@article{4ab0b08aafa14e8181744b7df66d91f9,

title = "Recent Advances in Fully Dynamic Graph Algorithms: A Quick Reference Guide",

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.",

keywords = "Dynamic algorithms, graph algorithms",

author = "Kathrin Hanauer and Monika Henzinger and Christian Schulz",

year = "2022",

month = dec,

day = "13",

doi = "https://doi.org/10.1145/3555806",

language = "English",

volume = "27",

pages = "1--45",

journal = "Journal of Experimental Algorithmics",

issn = "1084-6654",

number = "11",

}

TY - JOUR

T1 - Recent Advances in Fully Dynamic Graph Algorithms

T2 - A Quick Reference Guide

AU - Hanauer, Kathrin

AU - Henzinger, Monika

AU - Schulz, Christian

PY - 2022/12/13

Y1 - 2022/12/13

N2 - 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.

AB - 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.

KW - Dynamic algorithms

KW - graph algorithms

UR - http://www.scopus.com/inward/record.url?scp=85143115529&partnerID=8YFLogxK

U2 - https://doi.org/10.1145/3555806

DO - https://doi.org/10.1145/3555806

M3 - Article

VL - 27

SP - 1

EP - 45

JO - Journal of Experimental Algorithmics

JF - Journal of Experimental Algorithmics

SN - 1084-6654

IS - 11

M1 - 1.11

ER -

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

Abstract

Austrian Fields of Science 2012

Keywords

Access to Document

Other files and links

Fingerprint

Cite this