Identifying and locating-dominating codes: NP-completeness results for directed graphs. (English) Zbl 1062.94056
MSC:
94B25 | Combinatorial codes |
05C90 | Applications of graph theory |
68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |