License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.12.11.45
URN: urn:nbn:de:0030-drops-178354
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/17835/
Go back to Dagstuhl Reports

Bernstein, Aaron ; Chechik, Shiri ; Forster, Sebastian ; Kopelowitz, Tsvi ; Nazari, Yasamin ; Wein, Nicole
Weitere Beteiligte (Hrsg. etc.): Aaron Bernstein and Shiri Chechik and Sebastian Forster and Tsvi Kopelowitz and Yasamin Nazari and Nicole Wein

Dynamic Graph Algorithms (Dagstuhl Seminar 22461)

pdf-format:
dagrep_v012_i011_p045_22461.pdf (2 MB)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 22461 “Dynamic Graph Algorithms”, which took place from November 13 to November 18, 2022.
The field of dynamic graph algorithms studies algorithms for processing graphs that are changing over time. Formally, the goal is to process an interleaved sequence of update and query operations, where an update operation changes the input graph (e.g. inserts/deletes an edge), while the query operation is problem-specific and asks for some information about the current graph – for example, an s-t path, or a minimum spanning tree. The field has evolved rapidly over the past decade, and this Dagstuhl Seminar brought together leading researchers in dynamic algorithms and related areas of graph algorithms.

BibTeX - Entry

@Article{bernstein_et_al:DagRep.12.11.45,
  author =	{Bernstein, Aaron and Chechik, Shiri and Forster, Sebastian and Kopelowitz, Tsvi and Nazari, Yasamin and Wein, Nicole},
  title =	{{Dynamic Graph Algorithms (Dagstuhl Seminar 22461)}},
  pages =	{45--65},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{11},
  editor =	{Bernstein, Aaron and Chechik, Shiri and Forster, Sebastian and Kopelowitz, Tsvi and Nazari, Yasamin and Wein, Nicole},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/17835},
  URN =		{urn:nbn:de:0030-drops-178354},
  doi =		{10.4230/DagRep.12.11.45},
  annote =	{Keywords: dynamic graphs, graph algorithms}
}

Keywords: dynamic graphs, graph algorithms
Collection: DagRep, Volume 12, Issue 11
Issue Date: 2023
Date of publication: 04.05.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI