666 search results - page 78 / 134 » Unbalanced Graph Cuts |
109
Voted
STOC
2004
ACM
16 years 2 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...
160
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
105
click to vote
ENDM
2007
15 years 2 months ago
2007
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
113
Voted
WG
2007
Springer
15 years 8 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
106
Voted
COLING
2008
15 years 4 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...