29 search results - page 1 / 6 » Spectral bounds for the maximum cut problem |
NETWORKS
2008
13 years 4 months ago
2008
STACS
1994
Springer
13 years 8 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
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...
JMLR
2006
13 years 4 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...