arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.07441cs.DScs.CGcs.DC
收藏

嵌入平面图的完全可扩展大规模并行算法

Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs

Yi-Jun Chang, Da Wei Zheng

AI总结:

本文针对嵌入平面图提出完全可扩展的 MPC 常数轮算法,将每台机器内存需求从 n^{2/3+Ω(1)} 降至 n^δ,并解决连通性、MST、SSSP、最小割及最大流等问题。

摘要:

我们考虑大规模并行计算(MPC)模型,它是诸如 MapReduce 等大规模并行处理模型的理论抽象。在该模型中,假设广泛相信的 1-vs-2-cycles 猜想成立,在每台机器具有强次线性内存大小的情况下,用 O(1) 轮解决许多基本图问题是不可能的。我们改进了 Holm 和 Tětek [SODA 2023] 最近的工作,该工作在图给定平面嵌入时绕过了这一障碍。在之前的工作中,对于规模为 n 且具有 O(n/𝒮) 台机器的图,每台机器的内存大小至少需要为 𝒮 = n^{2/3+Ω(1)},而我们将其工作扩展到完全可扩展的情形,即每台机器的内存大小可以为 𝒮 = n^δ,其中 0<δ<1 为任意常数。我们针对嵌入平面图给出了首个常数轮完全可扩展算法,用于解决 (i) 连通性和 (ii) 最小生成树(MST)问题。此外,我们证明 Chang、Krauthgamer 和 Tan [STOC 2022] 的 ε-emulator 可以纳入我们的递归框架,从而获得常数轮 (1+ε)-近似算法,用于计算 (iii) 单源最短路径(SSSP)、(iv) 全局最小割和 (v) st-最大流。此前所有关于割和流的结果在 MPC 模型中都需要线性内存。此外,我们的结果还为隐式涉及嵌入平面图的问题提供了新算法。作为推论,我们给出了常数轮完全可扩展算法,用于 (vi) 使用 O(n) 总内存的 2D 欧几里得 MST 和 (vii) 使用 Õ(n^{2-δ}) 内存的 (1+ε)-近似加权编辑距离。我们的主要技术是一个递归框架,结合新颖的图绘制算法,在完全可扩展设置下以常数轮计算更小的嵌入平面图。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑