22 search results - page 1 / 5 » An exact algorithm for MAX-CUT in sparse graphs |
CPC
2006
13 years 5 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
ORL
2007
13 years 4 months ago
2007