Fixed-parameter tractability and completeness II: On completeness for W[1]

Theoretical Computer Science

Volumn 141, Issue 1-2, 1995, Pages 109-131

  Downey, Rod G ^a   Fellows, Michael R ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY; POLYNOMIALS; SET THEORY;

COMPLETENESS; FIXED PARAMETER PROBLEMS; PARAMETERIZED PROBLEMS; POLYNOMIAL TIME; TRACTABILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0029290085     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00097-3     Document Type: Article

References (22)

1. Fixed-parameter intractability II
2. Nondeterminism, within P
3. On disjoint cycles
4. The parameterized complexity of sequence alignment and concensus (extended abstract)
5. Parameterized learning complexity
6. Fixed-parameter tractability and completeness
7. Fixed-parameter intractability
8. Fixed-parameter tractability and completeness III: Some structural aspects of the W-hierarchy
9. R.G. Downey and M.F. Fellows, Parameterized computational feasibility, in: P. Clote and J. Remmel, eds., Feasible Mathematics II (Birkhauser, Boston) to appear.
10. On search, decision and the efficiency of polynomial-time algorithms
11. An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterizations
12. On limited nondeterminism and the complexity of the VC-dimension
13. Graph algorithms
14. The parameterized complexity of some problems in logic and linguistics (extended abstract)