arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.21733cs.DS
收藏

完全动态双连通性在 $\tilde{\mathcal{O}}(\log^2 n)$ 时间内

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time

Jacob Holm, Wojciech Nadara, Eva Rotenberg, Marek Sokołowski

AI总结:

提出确定性完全动态数据结构维护图割点信息,支持边插入删除及双连通性查询,通过归约、瞬态暴露和 VIP 邻居等技术,实现均摊 $O(\log^2 n \log^2 \log n)$ 更新和 $O(\log n \log^2 \log n)$ 查询。

摘要:

我们提出一种确定性的完全动态数据结构,用于维护图中割点(即移除后会使图不连通的顶点)的相关信息。该数据结构支持边的插入和删除,以及查询一对连通顶点是双连通的还是可以被割点分离,在后一种情况下,我们支持访问分离它们的割点。所有更新操作在均摊 $O(\log^2 n \log^2 \log n)$ 时间内完成,查询操作在最坏情况下 $O(\log n \log^2 \log n)$ 时间内完成。注意,这些时间界限与当前确定性动态连通性的最佳结果相比,仅相差 $\log \log n$ 因子。我们通过一系列归约,将原始问题转化为定义良好的数据结构问题,从而获得改进的运行时间。虽然我们确实应用了改进双连通性运行时间的著名技术 [STOC'00, SODA'18],但仅凭这些技术并不能达到 $\tilde{O}(\log^3 n)$ 的更新时间复杂度,更不用说我们最终给出的 $\tilde{O}(\log^2 n)$。我们的贡献包括一个正式定义的瞬态暴露操作,可以将其视为顶层树上更便宜的只读暴露操作。对于图中的每个顶点,我们维护一个关于其邻居的数据结构,并在该数据结构中应用两次偏置以节省两个 $\tilde{O}(\log n)$ 因子。其中一种偏置技术是一种新的偏置不相交集合数据结构,这可能具有独立的研究价值。此外,在该邻域数据结构中,我们允许顶点选择两个获得特殊待遇的 VIP 邻居,对应于其在暴露路径上可能存在的两个邻居,从而将 $\log n$ 时间的操作改进为常数时间。正是 VIP 邻居与瞬态暴露的结合,从另一个瓶颈中节省了 $\tilde{O}(\log n)$ 因子。

英文摘要:

We present a deterministic fully-dynamic data structure for maintaining information about the cut-vertices in a graph; i.e. the vertices whose removal would disconnect the graph. Our data structure supports insertion and deletion of edges, as well as queries to whether a pair of connected vertices are either biconnected, or can be separated by a cutvertex, and in the latter case we support access to separating cutvertices. All update operations are supported in amortized $O(\log^2 n \log^2 \log n)$ time, and queries take worst-case $O(\log n \log^2 \log n)$ time. Note that these time bounds match the current best for deterministic dynamic connectivity up to $\log \log n$ factors. We obtain our improved running time by a series of reductions from the original problem into well-defined data structure problems. While we do apply the well-known techniques for improving running time of two-edge connectivity [STOC'00, SODA'18], these techniques alone do not lead to an update time of $\tilde{O}(\log^3 n)$, let alone the $\tilde{O}(\log^2 n)$ we give as a final result. Our contributions include a formally defined transient expose operation, which can be thought of as a cheaper read-only expose operation on a top tree. For each vertex in the graph, we maintain a data structure over its neighbors, and in this data structure we apply biasing (twice) to save two $\tilde{O}(\log n)$ factors. One of these biasing techniques is a new biased disjoint sets data structure, which may be of independent interest. Moreover, in this neighborhood data structure, we facilitate that the vertex can select two VIP neighbors that get special treatment, corresponding to its potentially two neighbors on an exposed path, improving a $\log n$-time operation down to constant time. It is this combination of VIP neighbors with the transient expose that saves an $\tilde{O}(\log n)$-factor from another bottleneck.

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

↑