Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs

We consider the massively parallel computation (MPC) model, which is a theoretical abstraction of large-scale parallel processing models such as MapReduce. In this model, assuming the widely believed 1-vs-2-cycles conjecture, solving many basic graph problems in O(1) rounds with a strongly sublinear memory size per machine is impossible. We improve on the recent work of Holm and Tětek [SODA 2023] that bypass this barrier for problems when a planar embedding of the graph is given. In the previous work, on graphs of size n with O(n/S) machines, the memory size per machine needs to be at least S = n 2/3+Ω(1) , whereas we extend their work to the fully scalable regime, where the memory size per machine can be S = n δ for any constant 0 < δ < 1. We thus give the first constant round fully scalable algorithms for embedded planar graphs for the problems of (i) connectivity and (ii) minimum spanning tree (MST).

Moreover, we show that the ε-emulator of Chang, Krauthgamer, and Tan [STOC 2022] can be incorporated into our recursive framework to obtain constant-round (1 + ε)-approximation algorithms for the problems of computing (iii) single source shortest path (SSSP), (iv) global min-cut, and (v) st-max flow. All previous results on cuts and flows required linear memory in the MPC model. Furthermore, our results give new algorithms for problems that implicitly involve embedded planar graphs. We give as corollaries of our result the constant round fully scalable algorithms for (vi) 2D Euclidean MST using O(n) total memory and (vii) (1 + ε)approximate weighted edit distance using O(n 2-δ ) memory.

Our main technique is a recursive framework combined with novel graph drawing algorithms that allow us to compute smaller embedded planar graphs in constant rounds in the fully scalable setting.