Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands

Harald Räcke, Stefan Schmid 0001, Ruslan Zabrodin. Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands. In Kunal Agrawal, Julian Shun, editors, Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023. pages 403-413, ACM, 2023. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.