一种基于订单的快速堆芯维护方法
A Fast Order-Based Approach for Core Maintenance
摘要:
图已经被广泛地应用于诸如社交网络、协作网络和生物网络的许多应用中。一个重要的图分析是在大型图中探索内聚子图。在研究的几个凝聚子图中,k-核是一个静态图可以在线性时间内计算的子图。由于图在实际应用中是不断发展的,在本文中,我们研究了核心维护,这是减少计算成本计算k-核心的图时,图是不时动态更新。我们发现现有的高效算法的缺点,这需要一个大的搜索空间来找到需要更新的顶点,并有很高的开销来维护索引建立,当一个图更新。我们提出了一个新的顺序为基础的方法来维持一个秩序,称为k阶,顶点之间,而一个图更新。我们的新算法可以显着优于国家的最先进的算法高达3个数量级的11个大的真实图测试。我们在本文中报告了我们的发现。
英文摘要:
Graphs have been widely used in many applications such as social networks, collaboration networks, and biological networks. One important graph analytics is to explore cohesive subgraphs in a large graph. Among several cohesive subgraphs studied, k-core is one that can be computed in linear time for a static graph. Since graphs are evolving in real applications, in this paper, we study core maintenance which is to reduce the computational cost to compute k-cores for a graph when graphs are updated from time to time dynamically. We identify drawbacks of the existing efficient algorithm, which needs a large search space to find the vertices that need to be updated, and has high overhead to maintain the index built, when a graph is updated. We propose a new order-based approach to maintain an order, called k-order, among vertices, while a graph is updated. Our new algorithm can significantly outperform the state-of-the-art algorithm up to 3 orders of magnitude for the 11 large real graphs tested. We report our findings in this paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。