388 search results - page 3 / 78 » Improving Exact Algorithms for MAX-2-SAT |
86
Voted
ICTCS
2005
Springer
15 years 5 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...
100
click to vote
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
88
Voted
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
SIGGRAPH
1993
ACM
15 years 3 months ago
1993
ACM
CSDA
2006
14 years 11 months ago
2006