具有近线性预处理时间的平面图的最小st-割预言
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
摘要:
对于一个具有非负边权的无向$n$ -顶点平面图$G$,我们考虑以下类型的查询:给定$G$中的两个顶点$s$和$t$,$G$中的最小$st$ -割的权是多少?我们将展示如何回答这样的查询在恒定的时间与$O(n\log^4n)$预处理时间和$O(n\log n)$空间。我们使用Gomory-Hu树来隐式地表示所有的成对最小割。以前,没有次二次时间算法是已知的这个问题。由于平面图中的最小对割和最小圈基是对偶问题,我们还得到了最小圈基在$O(n\log^4n)$时间和$O(n\log n)$空间中的隐式表示.另外,可以在$O(C)$时间和空间中获得显式表示,其中$C$是基的大小。这些结果要求最短路径是唯一的。这可以通过使用无开销的随机化来保证,或者在预处理时间中使用附加的$\log^2 n$因子来确定性地保证。
英文摘要:
For an undirected $n$-vertex planar graph $G$ with non-negative edge-weights, we consider the following type of query: given two vertices $s$ and $t$ in $G$, what is the weight of a min $st$-cut in $G$? We show how to answer such queries in constant time with $O(n\log^4n)$ preprocessing time and $O(n\log n)$ space. We use a Gomory-Hu tree to represent all the pairwise min cuts implicitly. Previously, no subquadratic time algorithm was known for this problem. Since all-pairs min cut and the minimum cycle basis are dual problems in planar graphs, we also obtain an implicit representation of a minimum cycle basis in $O(n\log^4n)$ time and $O(n\log n)$ space. Additionally, an explicit representation can be obtained in $O(C)$ time and space where $C$ is the size of the basis. These results require that shortest paths are unique. This can be guaranteed either by using randomization without overhead, or deterministically with an additional $\log^2 n$ factor in the preprocessing times.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。