This report contains the program and outcomes of the Dagstuhl Seminar "Graph Algorithms: Distributed Meets Dynamic". The field of dynamic graph algorithms address recomputation following edge/vertex insertions/deletions in the input graph. Distributed graph algorithms focus on computing when the input resides across multiple machines, that need to communicate for their joint computation. The seminar brought together researchers from the two communities of dynamic graph algorithms and distributed computing. The aim was to transfer knowledge and techniques between the dynamic and distributed settings, build new collaborations and to explore research directions on computational models of the combined distributed dynamic setting.
@Article{censorhillel_et_al:DagRep.14.11.92, author = {Censor-Hillel, Keren and Nazari, Yasamin and Rotenberg, Eva and Saranurak, Thatchaphol and Costa, Mart{\'\i}n}, title = {{Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471)}}, pages = {92--107}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2025}, volume = {14}, number = {11}, editor = {Censor-Hillel, Keren and Nazari, Yasamin and Rotenberg, Eva and Saranurak, Thatchaphol and Costa, Mart{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.11.92}, URN = {urn:nbn:de:0030-drops-228186}, doi = {10.4230/DagRep.14.11.92}, annote = {Keywords: distributed algorithms, dynamic algorithms} }
Feedback for Dagstuhl Publishing