A local partitioning algorithm in a large graph finds a "community" for a given target node by examining only a small part of the entire graph. (A "community" is a set of nodes with relatively few bonds to the outside). This is useful in "divide and conquer" algorithms. Massive graphs of interest include the web-hyperlink graph, query-click graphs, advertiser-keyword graphs, and many others. I...