2026-08-17T03:53:11Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9831 2024-03-06T10:45:02Z ddc:004 open_access

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks Bamberger, Philipp Kuhn, Fabian Maus, Yannic dynamic networks distributed graph algorithms MIS vertex coloring We define a generalization of local distributed graph problems to (synchronous round-based) dynamic networks and present a framework for developing algorithms for these problems. We require two properties from our algorithms: (1) They should satisfy non-trivial guarantees in every round. The guarantees should be stronger the more stable the graph has been during the last few rounds and they coincide with the definition of the static graph problem if no topological change appeared recently. (2) If a constant neighborhood around some part of the graph is stable during an interval, the algorithms quickly converge to a solution for this part of the graph that remains unchanged throughout the interval. We demonstrate our generic framework with two classic distributed graph, namely (degree+1)-vertex coloring and maximal independent set (MIS). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Philipp Bamberger and Fabian Kuhn and Yannic Maus 2018 Is Part Of LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2018.42 urn:nbn:de:0030-drops-98318 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.42 eng https://creativecommons.org/licenses/by/3.0/legalcode