Pages that link to "Item:Q1401220"
From MaRDI portal
The following pages link to Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220):
Displaying 2 items.
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
