Prefer a chat interface with context about you and your work?
Local Distributed Algorithms in Highly Dynamic Networks
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. The algorithms 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 …