136 search results - page 1 / 28 » Experimental Study of Minimum Cut Algorithms |
SODA
1997
ACM
13 years 6 months ago
1997
ACM
IPCO
2008
13 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ISMM
2011
Springer
12 years 7 months ago
2011
Springer
We study hierarchical segmentations that are optimal in the sense of minimal spanning forests of the original image. We introduce a region-merging operation called uprooting, and w...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...