Fixed Parameter Tractability and Completeness

For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-Dominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as k-Feedback Vertex Set, exhibit fixed-parameter tractability: for each fixed k the problem is solvable in time bounded by a polynomial of degree c, where c is a constant independent of k. We show that for this problem, and for the problem of determining whether a graph has k disjoint cycles, we may take c = 1. We also show that if Dominating Set is fixed-parameter tractable, then so are a variety of parameterized problems, such as Independent Set. Some of the main results of a completeness theory for fixed-parameter intractability are surveyed.

[1]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[2]  Bernd Voigt,et al.  Finding Minimally Weighted Subgraphs , 1991, WG.

[3]  P. Erdös,et al.  On Independent Circuits Contained in a Graph , 1965, Canadian Journal of Mathematics.

[4]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[5]  Michael R. Fellows,et al.  On the complexity of fixed parameter problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[7]  Hans L. Bodlaender,et al.  On Disjoint Cycles , 1991, Int. J. Found. Comput. Sci..

[8]  Detlef Seese,et al.  Problems Easy for Tree-Decomposable Graphs (Extended Abstract) , 1988, ICALP.

[9]  Hans L. Bodlaender,et al.  On Linear Time Minor Tests and Depth First Search , 1989, WADS.

[10]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[11]  Clyde L. Monma,et al.  On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..

[12]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[13]  Hans L. Bodlaender,et al.  On Linear Time Minor Tests with Depth-First Search , 1993, J. Algorithms.

[14]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1993, JACM.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[17]  Michael R. Fellows,et al.  An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.