604 search results - page 3 / 121 » On the Complexity of the Maximum Cut Problem |
EMMCVPR
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
JGO
2010
13 years 4 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
SIAMCOMP
2011
12 years 8 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...