51 search results - page 1 / 11 » Geometry, flows, and graph-partitioning algorithms |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
WEA
2009
Springer
13 years 9 months ago
2009
Springer
We present initial results from the first empirical evaluation of a graph partitioning algorithm inspired by the Arora-Rao-Vazirani algorithm of [5], which combines spectral and ...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...