arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0702078cs.DScs.CC
收藏

求稠密子图的局部算法

A Local Algorithm for Finding Dense Subgraphs

Reid Andersen

摘要:

根据Kannan和Vinay提出的稠密度定义,给出了求二部图稠密子图的一个局部算法。我们的算法以一个具有指定起始顶点的二分图作为输入,并试图在该顶点附近找到一个稠密子图。证明了对于任意k个顶点且密度为theta的子图S,S中有相当多的起始顶点使得我们的算法在至多O(Dk^2)个顶点上产生密度为theta / O(log n)的子图S',其中D是最大度.该算法的运行时间是O(Dk^2),与图中的顶点数无关。

英文摘要:

We present a local algorithm for finding dense subgraphs of bipartite graphs, according to the definition of density proposed by Kannan and Vinay. Our algorithm takes as input a bipartite graph with a specified starting vertex, and attempts to find a dense subgraph near that vertex. We prove that for any subgraph S with k vertices and density theta, there are a significant number of starting vertices within S for which our algorithm produces a subgraph S' with density theta / O(log n) on at most O(D k^2) vertices, where D is the maximum degree. The running time of the algorithm is O(D k^2), independent of the number of vertices in the graph.

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

↑