平面图在次二次时间上的最小圈基与全对最小割
Minimum Cycle Basis and All-Pairs Min Cut of a Planar Graph in Subquadratic Time
摘要:
加权无向图$G$的最小圈基是$G$的圈空间的基,使得该基中的圈的总权重最小化。如果$G$是具有非负边权的平面图,则可以在$O(n^2)$时间和空间中找到这样的基,其中$n$是$G$的大小。我们表明,这是最佳的,如果需要一个明确的表示的基础。然后,我们提出了一个$O(n^{3/2}\log n)$时间和$O(n^{3/2})$空间算法,计算最小周期的基础\emph{implicitly}。从这个结果中,我们得到一个输出敏感的算法,明确地计算一个最小的循环基在$O(n^{3/2}\log n + C)$时间和$O(n^{3/2} + C)$空间,其中$C$是总大小(边和顶点的数量)的循环的基础。当$G$未加权时,这些界限分别减少为$O(n^{3/2}\log n)$和$O(n^{3/2})$。我们得到了类似的结果,所有对最小割问题,因为它是对偶等价的平面图的最小圈基问题。我们还获得了$O(n^{3/2}\log n)$时间和$O(n^{3/2})$空间算法,分别找到的重量向量和Gomory-Hu树的$G$。这两个问题以前的最佳时间和空间界限是二次的。通过我们的Gomory-Hu树算法,我们得到了如下结果:在$O(n^{3/2}\log n)$时间和$O(n^{3/2})$空间上进行预处理,$G$的任意两个给定顶点之间的最小割的权值可以在常数时间内被报告。以前,这样的预言需要二次的时间和空间进行预处理。Oracle还可以扩展以报告与其大小成比例的实际时间削减。
英文摘要:
A minimum cycle basis of a weighted undirected graph $G$ is a basis of the cycle space of $G$ such that the total weight of the cycles in this basis is minimized. If $G$ is a planar graph with non-negative edge weights, such a basis can be found in $O(n^2)$ time and space, where $n$ is the size of $G$. We show that this is optimal if an explicit representation of the basis is required. We then present an $O(n^{3/2}\log n)$ time and $O(n^{3/2})$ space algorithm that computes a minimum cycle basis \emph{implicitly}. From this result, we obtain an output-sensitive algorithm that explicitly computes a minimum cycle basis in $O(n^{3/2}\log n + C)$ time and $O(n^{3/2} + C)$ space, where $C$ is the total size (number of edges and vertices) of the cycles in the basis. These bounds reduce to $O(n^{3/2}\log n)$ and $O(n^{3/2})$, respectively, when $G$ is unweighted. We get similar results for the all-pairs min cut problem since it is dual equivalent to the minimum cycle basis problem for planar graphs. We also obtain $O(n^{3/2}\log n)$ time and $O(n^{3/2})$ space algorithms for finding, respectively, the weight vector and a Gomory-Hu tree of $G$. The previous best time and space bound for these two problems was quadratic. From our Gomory-Hu tree algorithm, we obtain the following result: with $O(n^{3/2}\log n)$ time and $O(n^{3/2})$ space for preprocessing, the weight of a min cut between any two given vertices of $G$ can be reported in constant time. Previously, such an oracle required quadratic time and space for preprocessing. The oracle can also be extended to report the actual cut in time proportional to its size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。