A Local Algorithm for Finding Dense Subgraphs
Year: 2007
Type: preprint
Abstract: 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 θ, there are a significant number of starting vertices within S for which our algorithm produces a subgraph S ′ with density Ω(θ / log n) on at most O(∆k 2) vertices, where ∆ is the maximum degree. The running time of the algorithm is O(∆k 2), independent of the number of vertices in the graph. 1
Source: arXiv (Cornell University)
Author: Reid Andersen
Institution: Microsoft (United States)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2953373266