Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

Kathrin Hanauer; Monika Henzinger; Christian Schulz

doi:10.4230/LIPIcs.SAND.2022.1

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

Kathrin Hanauer, Monika Henzinger, Christian Schulz

Research Group Theory and Applications of Algorithms

Publications: Contribution to book › Contribution to proceedings

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
Title of host publication	1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
Editors	James Aspnes, Othon Michail
ISBN (Electronic)	9783959772242
DOIs	https://doi.org/10.4230/LIPIcs.SAND.2022.1
Publication status	Published - 1 Apr 2022
Event	1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) - Online, United States Duration: 28 Mar 2022 → 30 Mar 2022 https://sand-conf.org/ https://sand2022.onrender.com/

Conference

Conference	1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
Country/Territory	United States
Period	28/03/22 → 30/03/22
Internet address	https://sand-conf.org/ https://sand2022.onrender.com/

Austrian Fields of Science 2012

102031 Theoretical computer science

Keywords

fully dynamic graph algorithms
survey

Access to Document

10.4230/LIPIcs.SAND.2022.1

http://eprints.cs.univie.ac.at/7316/

Cite this

@inproceedings{44bc6cb7ce2e403896b831a880bb9b9e,

title = "Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)",

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 = "fully dynamic graph algorithms, survey",

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

note = "Publisher Copyright: {\textcopyright} Kathrin Hanauer, Monika Henzinger, and Christian Schulz; licensed under Creative Commons License CC-BY 4.0; null ; Conference date: 28-03-2022 Through 30-03-2022",

year = "2022",

month = apr,

day = "1",

doi = "10.4230/LIPIcs.SAND.2022.1",

language = "English",

editor = "James Aspnes and Othon Michail",

booktitle = "1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)",

url = "https://sand-conf.org/, https://sand2022.onrender.com/",

}

TY - GEN

T1 - Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

AU - Hanauer, Kathrin

AU - Henzinger, Monika

AU - Schulz, Christian

N1 - Publisher Copyright: © Kathrin Hanauer, Monika Henzinger, and Christian Schulz; licensed under Creative Commons License CC-BY 4.0

PY - 2022/4/1

Y1 - 2022/4/1

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 - fully dynamic graph algorithms

KW - survey

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

U2 - 10.4230/LIPIcs.SAND.2022.1

DO - 10.4230/LIPIcs.SAND.2022.1

M3 - Contribution to proceedings

BT - 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)

A2 - Aspnes, James

A2 - Michail, Othon

Y2 - 28 March 2022 through 30 March 2022

ER -

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

Abstract

Conference

Austrian Fields of Science 2012

Keywords

Access to Document

Other files and links

Cite this