Pages that link to "Item:Q264560"
From MaRDI portal
The following pages link to More results on the complexity of identifying problems in graphs (Q264560):
Displaying 6 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- On \(t\)-revealing codes in binary Hamming spaces (Q2272993) (← links)
- Tolerant location detection in sensor networks (Q2280052) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
