166
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
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...