Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 2109-2120

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

^a CNRS   (France)

Author keywords

Coding theory; Complexity; Graph; Identifying code; Locating dominating code; NP completeness

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING; FORMAL LOGIC; GRAPH THEORY; LOCATION;

CODING THEORY; COMPLEXITY; GRAPH; IDENTIFYING CODE; LOCATING-DOMINATING CODE; NP-COMPLETENESS;

C (PROGRAMMING LANGUAGE);

EID: 2342497660     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00536-4     Document Type: Article

References (5)

1. [1] Barthélemy, J.-P., Cohen, G., Lobstein, A., Algorithmic Complexity and Communication Problems, 1996, University College of London, UCL Press Limited, London.
2. [2] Cohen, G., Honkala, I., Lobstein, A., Zémor, G., On identifying codes. Barg, A., Litsyn, S., (eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Proc. DIMACS Workshop on Codes and Association Schemes, Vol. 56, 2001, AMS, Providence, 97–109.
3. [3] Colbourn, C.J., Slater, P.J., Stewart, L.K., Locating dominating sets in series parallel networks. Congr. Numer. 56 (1987), 135–162.
4. [4] Haynes, T.W., Hedetniemi, S.T., Slater, P.J., Fundamentals of Domination in Graphs, 1998, Marcel Dekker, New York.
5. [5] Karpovsky, M.G., Chakrabarty, K., Levitin, L.B., On a new class of codes for identifying vertices in graphs. IEEE Trans. Inform. Theory 44 (1998), 599–611.