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/\mathcal{S})$ machines, the memory size per machine needs to be at least $\mathcal{S} = n^{2/3+Ω(1)}$, whereas we extend their work to the fully scalable regime, where the memory size per machine can be $\mathcal{S} = n^δ$ for any constant $0< δ< 1$. We 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 $\varepsilon$-emulator of Chang, Krauthgamer, and Tan [STOC 2022] can be incorporated into our recursive framework to obtain constant-round $(1+\varepsilon)$-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 constant round fully scalable algorithms for (vi) 2D Euclidean MST using $O(n)$ total memory and (vii) $(1+\varepsilon)$-approximate weighted edit distance using $\widetilde{O}(n^{2-δ})$ memory.
Our main technique is a recursive framework combined with novel graph drawing algorithms to compute smaller embedded planar graphs in constant rounds in the fully scalable setting.
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
给定一个无向的边加权图G和一对顶点(称为终端对),最小多割问题要求一个最小权的边集,使得删除这些边后,每对的两个终端属于图的不同连通分支。依赖于拓扑技术,我们提供了一个多项式时间算法的情况下,G是嵌入在一个固定的曲面上的亏格g(例如,当G是平面时),并且具有固定数量t的端子。运行时间是一个多项式的次数为O(sqrt{g^2+gt})的输入大小。在平面情况下,我们的结果纠正了Bentz [Int. Workshop on Parameterized and Exact Computation,109-119,2012]的扩展摘要中的错误。最小多割问题也是多路割问题的一个推广,也称为多路割问题。多端切割问题;即使对于这种特殊情况,也没有专门的算法用于嵌入表面上的图形。
Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
David R. Cheriton School of Computer Science, University of Waterloo(滑铁卢大学大卫R·切里顿计算机科学学院);School of Computer Science, Carleton University(卡尔顿大学计算机科学学院)
Holiest Minimum-Cost Paths and Flows in Surface Graphs
设$G$是一个边权有向图,其中$n$的顶点嵌入在亏格为$g$的可定向曲面上.我们描述了一个简单的确定性字典序扰动方案,该方案保证了$G$中最小成本流和最短路径的唯一性。扰动需要$O(gn)$时间来计算。我们使用我们的扰动计划在一个黑盒的方式来获得一个确定性的$O(n \log \log n)$时间算法的最小切割\emph{directed}边加权平面图和一个确定性的$O(g^2 n \log n)$时间预处理计划的多源最短路径问题的计算最短路径预言的所有顶点躺在一个表面嵌入图的公共面。后者的结果产生更快的确定性近线性时间算法的各种问题,在常亏格表面嵌入图。最后,我们打开黑盒子,以推广最近的线性时间算法的多源最短路径在无向平面图工作在任意定向表面。我们的算法运行在$O(g^2 n \log g)$时间在此设置,它可以用来给改进的线性时间算法的几个问题的无权无向面嵌入图的常亏格,包括计算最小割,最短的拓扑非平凡圈,最小的同源基。