广义网络拆解的包围法
Ensemble approach for generalized network dismantling
摘要:
在一个网络中寻找一组节点,将这些节点移除后使网络以最小代价分裂到某个目标大小以下,称为网络拆除问题,属于NP难计算类。在本文中,我们探讨(广义)网络拆除问题,探索谱近似与功率迭代法的变体。特别是,我们通过从不同的初始条件和谱近似的不同迭代次数创建可能的解决方案的集合来探索网络拆除解决方案景观。
英文摘要:
Finding a set of nodes in a network, whose removal fragments the network below some target size at minimal cost is called network dismantling problem and it belongs to the NP-hard computational class. In this paper, we explore the (generalized) network dismantling problem by exploring the spectral approximation with the variant of the power-iteration method. In particular, we explore the network dismantling solution landscape by creating the ensemble of possible solutions from different initial conditions and a different number of iterations of the spectral approximation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。