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

电流流组接近中心性的快速最大化

Fast Maximization of Current Flow Group Closeness Centrality

Haisong Xia, Zhongzhi Zhang

AI总结:

针对无向图中节点组电流流接近中心性(CFCC)最大化这一NP困难问题,提出基于生成森林采样和Schur complement的两种近线性贪心算法,实现高近似比并在百万级真实图上验证了其高效性与有效性。

摘要:

电流流接近中心性(CFCC)源自有效电阻,用于衡量具有 $n$ 个节点的无向图中节点组的重要性。鉴于识别关键节点的广泛应用,我们研究了在基数约束 $|S|=k\ll n$ 下最大化节点组 $S$ 的 CFCC 问题。尽管该问题已被证明是 NP 困难的,我们提出了两种新颖的贪心算法来求解。我们的算法基于生成森林采样和 Schur complement,展现出近乎线性的时间复杂度,并对任意 $0<ε<1$ 达到了 $1-\frac{k}{k-1}\frac{1}{\mathrm{e}}-ε$ 的近似因子。在真实图上的大量实验表明,我们的算法在效率和有效性上均优于 state-of-the-art 方法,可扩展至具有数百万节点的图。

英文摘要:

Derived from effective resistances, the current flow closeness centrality (CFCC) for a group of nodes measures the importance of node groups in an undirected graph with $n$ nodes. Given the widespread applications of identifying crucial nodes, we investigate the problem of maximizing CFCC for a node group $S$ subject to the cardinality constraint $|S|=k\ll n$. Despite the proven NP-hardness of this problem, we propose two novel greedy algorithms for its solution. Our algorithms are based on spanning forest sampling and Schur complement, which exhibit nearly linear time complexities and achieve an approximation factor of $1-\frac{k}{k-1}\frac{1}{\mathrm{e}}-ε$ for any $0<ε<1$. Extensive experiments on real-world graphs illustrate that our algorithms outperform the state-of-the-art method in terms of efficiency and effectiveness, scaling to graphs with millions of nodes.

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

↑