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 12 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- Combinatorial identification problems and graph powers (Q766254) (← 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)
- On the complexity of the identifiable subgraph problem, revisited (Q2357777) (← links)
- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths (Q2876554) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)