Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning

DOI10.1145/3382734.3405696OpenAlexW3046767043MaRDI QIDQ5855272

Stefan Schmid, Maciej Pacut, Mahmoud Parham

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3382734.3405696

zbMATH Keywords

online algorithmsgraph partitioningself-adjusting networks

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Improved analysis of online balanced clustering

This page was built for publication: Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning