Minimizing the size of an identifying or...

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

Irène Charon, Olivier Hudry, Antoine Lobstein
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
290
Year:
2003
Language:
english
Pages:
12
DOI:
10.1016/s0304-3975(02)00536-4
File:
PDF, 144 KB
english, 2003
Conversion to is in progress
Conversion to is failed