arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.07561cs.DScs.SI
收藏

最大缺陷团计算:改进的时间复杂度与实际性能

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance

Lijun Chang

AI总结:

针对最大k-缺陷团计算问题,提出kDC-Two算法优化时间复杂度,结合新型度序列约简规则提升实际性能,实验表明其比现有最快算法快数个数量级。

摘要:

$k$-缺陷团($k$-defective clique)是团的一种松弛形式,允许最多存在$k$条缺失边,近年来受到越来越多的关注。尽管寻找最大$k$-缺陷团的问题是NP难的,但文献中近期已提出多种实用算法,其中kDC是当前的最优算法。kDC不仅在实际运行中速度最快,还实现了最优的时间复杂度。具体而言,忽略多项式因子时,其运行时间为$O^*(γ_k^n)$;其中$γ_k$是小于2且仅依赖于$k$的常数,$n$是输入图$G$的顶点数。\n本文提出kDC-Two算法,以同时提升时间复杂度和实际性能。当最大$k$-缺陷团规模$ω_k(G)$至少为$k+2$时,kDC-Two的运行时间为$O^*( (αΔ)^{k+2} γ_{k-1}^α)$;否则运行时间为$O^*(γ_{k-1}^n)$,其中$α$和$Δ$分别是图$G$的简并度(degeneracy)和最大度。此外,经过轻微修改,kDC-Two还可利用简并度间隙$α+k+1-ω_k(G)$参数化,实现$O^*( (αΔ)^{k+2} (k+1)^{α+k+1-ω_k(G)})$的时间复杂度;当$ω_k(G)$接近基于简并度的上界$α+k+1$时,该复杂度优于$O^*( (αΔ)^{k+2}γ_{k-1}^α)$。\n最后,为进一步提升实际性能,本文提出一种可高效应用的新型基于度序列的约简规则,并从理论上证明了其相较于文献中已有规则的有效性。在三个基准图数据集上的大量实证研究表明,本文算法的性能比现有最快算法高出数个数量级。

英文摘要:

The concept of $k$-defective clique, a relaxation of clique by allowing up-to $k$ missing edges, has been receiving increasing interests recently. Although the problem of finding the maximum $k$-defective clique is NP-hard, several practical algorithms have been recently proposed in the literature, with kDC being the state of the art. kDC not only runs the fastest in practice, but also achieves the best time complexity. Specifically, it runs in $O^*(γ_k^n)$ time when ignoring polynomial factors; here, $γ_k$ is a constant that is smaller than two and only depends on $k$, and $n$ is the number of vertices in the input graph $G$. In this paper, we propose the kDC-Two algorithm to improve the time complexity as well as practical performance. kDC-Two runs in $O^*( (αΔ)^{k+2} γ_{k-1}^α)$ time when the maximum $k$-defective clique size $ω_k(G)$ is at least $k+2$, and in $O^*(γ_{k-1}^n)$ time otherwise, where $α$ and $Δ$ are the degeneracy and maximum degree of $G$, respectively. In addition, with slight modification, kDC-Two also runs in $O^*( (αΔ)^{k+2} (k+1)^{α+k+1-ω_k(G)})$ time by using the degeneracy gap $α+k+1-ω_k(G)$ parameterization; this is better than $O^*( (αΔ)^{k+2}γ_{k-1}^α)$ when $ω_k(G)$ is close to the degeneracy-based upper bound $α+k+1$. Finally, to further improve the practical performance, we propose a new degree-sequence-based reduction rule that can be efficiently applied, and theoretically demonstrate its effectiveness compared with those proposed in the literature. Extensive empirical studies on three benchmark graph collections show that our algorithm outperforms the existing fastest algorithm by several orders of magnitude.

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

↑