Brief announcement: Efficient load-balancing through distributed token dropping

DOI10.4230/lipics.disc.2020.40zbMATH Open1540.68171MaRDI QIDQ6535039

Jara Uitto, Sebastian F. Brandt, Joel Rybicki, Barbara Keller, Jukka Suomela

Publication date: 2 November 2023

zbMATH Keywords

distributed algorithmsgraph problemssemi-matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Linear-in-\(\varDelta \) lower bounds in the LOCAL model
• Locality in Distributed Graph Algorithms
• What Can be Computed Locally?
• Distributed 2-Approximation Algorithm for the Semi-matching Problem
• An Automatic Speedup Theorem for Distributed Problems

This page was built for publication: Brief announcement: Efficient load-balancing through distributed token dropping