The following pages link to On identifying codes (Q2717197):
Displaying 45 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Combinatorial identification problems and graph powers (Q766254) (← links)
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Identifying codes of degree 4 Cayley graphs over abelian groups (Q2346707) (← links)
- Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- On cages admitting identifying codes (Q2426452) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Identifying codes of cycles (Q2488842) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Codes for strong identification (Q2741420) (← links)
- Edge identifying codes (Q2857369) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Discriminating codes in bipartite graphs (Q3439638) (← links)
- (Q3625849) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- Code Reverse Engineering Problem for Identification Codes (Q5272022) (← links)
- (Q5878174) (← links)
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)
- Progress on fault-tolerant locating-dominating sets (Q6174163) (← links)
- Density of identifying codes of hexagonal grids with finite number of rows (Q6550909) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- Optimal local identifying and local locating-dominating codes (Q6614544) (← links)
- Fault-tolerant locating-dominating sets on the infinite tumbling block graph (Q6644885) (← links)
- Optimal error-detection system for identifying codes (Q6663966) (← links)
