Expanding a seed set into a larger community is an important task for various algorithms that run on the world wide web graph, including topic-sensitive search ranking, community finding, and topic distillation. We present an algorithm that expands a seed set using random walks and maximum flow computations. Our algorithm finds a community with small conductance by adding nodes related to the seed, while examining only a small neighborhood of the entire graph.