2026-07-20T05:24:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:22818 2026-04-20T11:49:40Z ddc:004 open_access

Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471) Censor-Hillel, Keren Nazari, Yasamin Rotenberg, Eva Saranurak, Thatchaphol Costa, Martín distributed algorithms dynamic algorithms 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Keren Censor-Hillel and Yasamin Nazari and Eva Rotenberg and Thatchaphol Saranurak and Martín Costa 2025 Is Part Of Dagstuhl Reports, Volume 14, Issue 11 (2025) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.14.11.92 urn:nbn:de:0030-drops-228186 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.11.92 eng https://creativecommons.org/licenses/by/4.0/legalcode