Identifying and locating-dominating codes: NP-completeness results for directed graphs

IEEE Transactions on Information Theory

Volumn 48, Issue 8, 2002, Pages 2192-2200

  Charon, Irène ^a   Hudry, Olivier ^a   Lobstein, Antoine ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Bipartite graph; Coding theory; Complexity; NP hardness; Polynomial reduction

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; ENCODING (SYMBOLS); GRAPH THEORY; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

BIPARTITE GRAPH; CODING THEORY; IDENTIFYING CODE; LOCATING DOMINATING CODE;

CODES (SYMBOLS);

EID: 0036671935     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.800490     Document Type: Article

References (21)

1. Complexity issues in coding theory
2. On the inherent intractability of certain coding problems
3. The hardness of decoding linear codes with pre-processing
4. Fault isolation and diagnosis in multiprocessor systems with point-to-point connections
5. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
6. On identifying codes
7. Locating dominating sets in series parallel networks
8. On covering problems of codes
9. On the complexity of calculating the minimum norm of a code
10. On identifying codes in binary Hamming spaces
11. On the complexity of the identification problem in Hamming spaces
12. On a new class of codes for identifying vertices in graphs
13. On the covering of vertices for fault diagnosis in hypercubes
14. The complexity of computing the covering radius of a code
15. Domination and location in acyclic graphs
16. The intractability of computing the minimum distance of a code