Almost 2-SAT is fixed-parameter tractable
Authors:
- Igor RazgonIRIgor Razgon
- Barry O'SullivanBOBarry O'Sullivan
- 1 December 2009
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (8) , 435-450
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- A fixed-parameter algorithm for the directed feedback vertex set problem2008
- Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database ProblemsThe Computer Journal, 2007
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem2007
- Improved Algorithms for the Feedback Vertex Set ProblemsLecture Notes in Computer Science, 2007
- Techniques for Practical Fixed-Parameter AlgorithmsThe Computer Journal, 2007
- Parameterized Approximability of the Disjoint Cycle ProblemLecture Notes in Computer Science, 2007
- Complexity and Exact Algorithms for MulticutLecture Notes in Computer Science, 2006
- Algorithm Engineering for Optimal Graph Bipartization2005
- Improved exact algorithms for MAX-SATDiscrete Applied Mathematics, 2004
- Parameterized complexity of finding subgraphs with hereditary propertiesTheoretical Computer Science, 2002