Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
Irène CharonOlivier HudryAntoine LobsteinPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- np hard
- computational complexity
- graph representation
- np complete
- lower bound
- closely related
- source code
- scheduling problem
- random walk
- special case
- maximal cliques
- graph theory
- optimal solution
- maximum weight
- approximation algorithms
- bounded treewidth
- graph theoretic
- linear programming
- worst case
- undirected graph
- graph partitioning
- graph structure
- neural network
- minimum spanning tree
- multiobjective optimization
- connected components
- maximum clique
- remains np hard