Perfect code is W[1]-complete

Authors:
Marco Cesati
Affiliations:
Department of Computer Science, Systems, and Industrial Engineering, University of Rome "Tor Vergata"/, via di Tor Vergata 110, I-00133 Rome, Italy
Venue:
Information Processing Letters
Year:
2002

Citing 4
Cited 12

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

Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results

SIAM Journal on Computing
Threshold dominating sets and an improved characterization of W[2]

Theoretical Computer Science
Parameterized Complexity

Parameterized Complexity

Parameterized complexity of finding subgraphs with hereditary properties

Theoretical Computer Science
Parameterized Counting Problems

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The turing way to parameterized complexity

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Chordless paths through three vertices

Theoretical Computer Science - Parameterized and exact computation
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Parameterized Complexity for Domination Problems on Degenerate Graphs

Graph-Theoretic Concepts in Computer Science
Parameterized computational complexity of control problems in voting systems

Theoretical Computer Science
Parameterized complexity of control problems in Maximin election

Information Processing Letters
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Parameterized complexity of generalized domination problems

Discrete Applied Mathematics
Parameterized complexity in multiple-interval graphs: domination

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy

Theoretical Computer Science

Quantified Score

Hi-index	0.90

Visualization

Abstract

We show that the parameterized problem PERFECT CODE belongs to W[1]. This result closes an old open question, because it was often conjectured that PERFECT CODE could be a natural problem having complexity degree intermediate between W[1] and W[2]. This result also shows W[1]-membership of the parameterized problem WEIGHTED EXACT CNF SATISFIABILITY.