Concepedia

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

Irène Charon, Olivier Hudry, Antoine Lobstein

Theoretical Computer Science · 2003 · 151 citations · 1 references

DOI

Concepts

References

1

On a new class of codes for identifying vertices in graphs

Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. Levitin · IEEE Transactions on Information Theory · 1998 · 435 citations

, , +9