New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.
New lower bound for 2-identifying code in the square grid
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The paper surveys Iiro Honkala's contributions to identifying codes across complexity, combinatorics, grids, graph parameters, structural properties, and optimal code counts.
citing papers explorer
-
Finding codes on infinite grids automatically
New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.