Year: 2025
Type: conference-paper
Abstract: This paper presents massively parallel computation (MPC) algorithms in the strongly sublinear memory regime (aka, scalable MPC) for orienting and coloring graphs as a function of its subgraph density. Our algorithms run in poly(log log n) rounds and compute an orientation of the edges with maximum outdegree O (α log log n) as well as a coloring of the vertices with O (α log log n) colors. Here, α denotes the density of the densest subgraph. Our algorithm's round complexity is notable because it breaks the [EQUATION] barrier, which applied to the previously best known density-dependent orientation algorithm [Ghaffari, Lattanzi, and Mitrovic ICML'19] and is common to many other scalable MPC algorithms.
Authors: Mohsen Ghaffari, Christoph Grunau
Institutions: Massachusetts Institute of Technology, ETH Zurich
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4411278297