Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning

DOI10.1145/3382734.3405696MaRDI QIDQ5855272zbMATH OpenOpenAlexFDO

Authors Maciej Pacut, Mahmoud Parham, Stefan Schmid

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

graph partitioningonline algorithmsself-adjusting networks

Mathematics Subject Classification ID

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

Cited in

(3)

• Improved analysis of online balanced clustering
• An improved approximation algorithm for dynamic minimum linear arrangement
• A subquadratic bound for online bisection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855272)