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

大量图的动态近似最大独立集

Dynamic Approximate Maximum Independent Set on Massive Graphs

Xiangyu Gao, Jianzhong Li, Dongjing Miao

摘要:

计算最大独立集(MaxIS)是图论中一个基本的NP-难问题,它在许多领域都有重要的应用。由于在许多应用中的图形是随着时间的推移而频繁变化的,在动态图上维护MaxIS的问题在过去几年中引起了越来越多的关注。由于难以保持精确的MaxIS,本文旨在开发有效的算法,可以保持近似MaxIS的精度保证理论。特别是,我们提出了一个框架,保持一个$(\fracΔ{2} + 1)$近似MaxIS动态图,并证明它在许多现实世界的网络中实现了恒定的近似比。据我们所知,这是第一个非平凡的逼近结果的动态MaxIS问题。在此框架下,我们实现了一个有效的线性时间动态算法和一个更有效的动态算法与近线性的预期时间复杂度。我们在真实图和合成图上的全面实验证明了所提出的算法的有效性和效率,特别是当图是高度动态的。

英文摘要:

Computing a maximum independent set (MaxIS) is a fundamental NP-hard problem in graph theory, which has important applications in a wide spectrum of fields. Since graphs in many applications are changing frequently over time, the problem of maintaining a MaxIS over dynamic graphs has attracted increasing attention over the past few years. Due to the intractability of maintaining an exact MaxIS, this paper aims to develop efficient algorithms that can maintain an approximate MaxIS with an accuracy guarantee theoretically. In particular, we propose a framework that maintains a $(\fracΔ{2} + 1)$-approximate MaxIS over dynamic graphs and prove that it achieves a constant approximation ratio in many real-world networks. To the best of our knowledge, this is the first non-trivial approximability result for the dynamic MaxIS problem. Following the framework, we implement an efficient linear-time dynamic algorithm and a more effective dynamic algorithm with near-linear expected time complexity. Our thorough experiments over real and synthetic graphs demonstrate the effectiveness and efficiency of the proposed algorithms, especially when the graph is highly dynamic.

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

↑