13 citations · 25 across the 3 of their papers we have counts for
3 papers
cs.DS2008★ 1 cited
Finding Sparse Cuts Locally Using Evolving Sets
Reid Andersen, Yuval Peres
A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph , starting from a spe…
cs.DS2007★ 13 cited
A Local Algorithm for Finding Dense Subgraphs
Reid Andersen
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 bi…
cs.DS2007★ 11 cited
Finding large and small dense subgraphs
Reid Andersen
We consider two optimization problems related to finding dense subgraphs. The densest at-least-k-subgraph problem (DalkS) is to find an induced subgraph of highest average degree a…