#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1999

2018

- This year (1)
- Last 5 years (2)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Organism

Learn More

- Reid Andersen, Fan Chung Graham, Kevin J. Lang
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than the size of the inputâ€¦ (More)

- Reid Andersen, Kevin J. Lang
- WWW
- 2006

Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed set into a communityâ€¦ (More)

- Reid Andersen, Kumar Chellapilla
- WAW
- 2009

We consider the problem of finding dense subgraphs with specified upper or lower bounds on the number of vertices. We introduce two optimization problems: the densest at-least-k-subgraph problemâ€¦ (More)

- Reid Andersen, Yuval Peres
- STOC
- 2009

A local graph partitioning algorithm finds a set of vertices with small conductance (i.e.~a sparse cut) by adaptively exploring a large graph G, starting from a specified vertex. For the algorithm toâ€¦ (More)

- Reid Andersen, Fan Chung Graham, Kevin J. Lang
- Internet Mathematics
- 2008

A local partitioning algorithm finds a set with small conductance near a specified seed vertex. In this paper, we present a generalization of a local partitioning algorithm for undirected graphs toâ€¦ (More)

- Reid Andersen, Christian Borgs, +5 authors Moshe Tennenholtz
- WWW
- 2008

High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommendations mayâ€¦ (More)

- Reid Andersen, Fan Chung Graham, Kevin J. Lang
- Internet Mathematics
- 2007

A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than the size of the inputâ€¦ (More)

- Reid Andersen, Kevin J. Lang
- SODA
- 2008

We present an algorithm called Improve that improves a proposed partition of a graph, taking as input a subset of vertices and returning a new subset of vertices with a smaller quotient cut score.â€¦ (More)

- Reid Andersen, Fan Chung Graham
- TAMC
- 2007

We show that whenever there is a sharp drop in the numerical rank defined by a personalized PageRank vector, the location of the drop reveals a cut with small conductance. We then show that for anyâ€¦ (More)