arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.03037cs.DS
收藏

近优全动态可否认子图

Near-Optimal Fully Dynamic Densest Subgraph

Saurabh Sawlani, Junxing Wang

摘要:

我们给出了第一个完全动态的算法,它保持了一个$(1-ε)$ -近似的denominant子图在最坏情况下的时间$\text{poly}(\log n, ε^{-1})$每次更新。稠密子图发现是社区发现、垃圾链接检测、距离查询索引和计算生物学等许多实际应用的重要基础。我们接近的dennial子图的问题,通过框架作为一个图的方向问题,我们解决了使用增强路径调整技术的对偶。我们的结果改进了以前的最佳逼近因子的$\left(\frac{1}{4} - ε\right)$的完全动态denominator子图[Bhattacharya et.例如,STOC `15]。我们还扩展了我们的技术,以解决问题的顶点加权图具有类似的运行时间。另外,我们将有向图上的$(1-ε)$ -近似可分解子图问题归结为点权图上的$(1-ε)$ -近似可分解子图的$O(\log n/ε)$实例.这种减少,连同我们的算法顶点加权图,给出了第一个全动态算法的有向denominator子图在最坏情况下的时间$\text{poly}(\log n, ε^{-1})$每次更新。此外,结合一个近似线性时间算法的denominator子图[Bahmani et.例如,WAW `14],给出了有向可否认子图的第一个近线性时间算法。

英文摘要:

We give the first fully dynamic algorithm which maintains a $(1-ε)$-approximate densest subgraph in worst-case time $\text{poly}(\log n, ε^{-1})$ per update. Dense subgraph discovery is an important primitive for many real-world applications such as community detection, link spam detection, distance query indexing, and computational biology. We approach the densest subgraph problem by framing its dual as a graph orientation problem, which we solve using an augmenting path-like adjustment technique. Our result improves upon the previous best approximation factor of $\left(\frac{1}{4} - ε\right)$ for fully dynamic densest subgraph [Bhattacharya et. al., STOC `15]. We also extend our techniques to solving the problem on vertex-weighted graphs with similar runtimes. Additionally, we reduce the $(1-ε)$-approximate densest subgraph problem on directed graphs to $O(\log n/ε)$ instances of $(1-ε)$-approximate densest subgraph on vertex-weighted graphs. This reduction, together with our algorithm for vertex-weighted graphs, gives the first fully-dynamic algorithm for directed densest subgraph in worst-case time $\text{poly}(\log n, ε^{-1})$ per update. Moreover, combined with a near-linear time algorithm for densest subgraph [Bahmani et. al., WAW `14], this gives the first near-linear time algorithm for directed densest subgraph.

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

↑