Optimal local identifying and local locating-dominating codes

Tuomo Lehtilä, Pyry Herva, Tero Laihonen

Publication date: 7 October 2024

Published in: Fundamenta Informaticae (Search for Journal in Brave)

hypercubes identifying codes dominating sets locating-dominating codes discharging methods infinite grids local identifying codes local locating-dominating codes

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Optimal lower bound for 2-identifying codes in the hexagonal grid
Locally identifying coloring of graphs
An introduction to the discharging method via graph coloring
(Total) domination in prisms
On locating--dominating sets in infinite grids
New bounds on binary identifying codes
New identifying codes in the binary Hamming space
The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
Fault-tolerant locating-dominating sets
A note on domination and total domination in prisms
Improved lower bound for locating-dominating codes in binary Hamming spaces
Local metric dimension of graphs: generalized hierarchical products and some applications
An optimal locating-dominating set in the infinite triangular grid
New bounds on the minimum density of an identifying code for the infinite hexagonal grid
Nonlocal metric dimension of graphs
Bounds for codes identifying vertices in the hexagonal grid
On identifying codes
On codes identifying vertices in the two-dimensional square lattice with diagonals
Unidirectional covering codes
On a new class of codes for identifying vertices in graphs
New binary covering codes obtained by simulated annealing
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
Covering problems for dichotomized matchings
Bounds on identifying codes
Identifying codes with small radius in some infinite regular graphs
New bounds and constructions for neighbor-locating colorings of graphs
The \textsc{Red-Blue Separation} problem on graphs

This page was built for publication: Optimal local identifying and local locating-dominating codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614544)