Dynamic Graph Algorithms (Dagstuhl Seminar 22461)
| Autor: | Bernstein, Aaron, Chechik, Shiri, Forster, Sebastian, Kopelowitz, Tsvi, Nazari, Yasamin, Wein, Nicole |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: | |
| DOI: | 10.4230/dagrep.12.11.45 |
| Popis: | 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. DagRep, Volume 12, Issue 11, pages 45-65 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|