On identifying codes that are robust against edge changes

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Information and Computation

• Publication date

  2007-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ic.2007.01.003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On Identifying Codes in the King Grid that are Robust Against Edge Deletions

  2008cited by this paper
• On robust and dynamic identifying codes

  2006cited by this paper
• On robust identification in the square and king grids

  2006cited by this paper
• On locating-dominating sets in infinite grids

  2006cited by this paper
• On 2-edge robust r-identifying codes in the king grid

  2006cited by this paper
• Optimal t-Edge-Robust r-Identifying Codes in the King Lattice

  2006cited by this paper
• A family of optimal identifying codes in Z2

  2006cited by this paper
• An optimal locating-dominating set in the infinite triangular grid

  2006cited by this paper
• Covering Codes

  2005cited by this paper
• On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes

  2005cited by this paper
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid

  2005cited by this paper
• On identifying codes in the triangular and square grids

  2004cited by this paper
• Identifying and locating-dominating codes on chains and cycles

  2004cited by this paper
• On identifying codes in the hexagonal mesh

  2004cited by this paper
• An Optimal Edge-Robust Identifying Code in the Triangular Lattice

  2004cited by this paper
• Robust location detection in emergency sensor networks

  2003influential reference
• Codes for Identification in the King Lattice

  2003cited by this paper
• Sequences of optimal identifying codes

  2002cited by this paper
• On strongly identifying codes

  2002cited by this paper
• On Identifying Codes in Binary Hamming Spaces

  2002cited by this paper
• Fault-tolerant locating-dominating sets

  2002cited by this paper
• Identifying Codes with Small Radius in Some Infinite Regular Graphs

  2002cited by this paper
• Optimal Codes for Strong Identification

  2002cited by this paper
• Families of optimal codes for strong identification

  2002cited by this paper
• General Bounds for Identifying Codes in Some Infinite Regular Graphs

  2001cited by this paper
• On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals

  2001cited by this paper
• Bounds for Codes Identifying Vertices in the Hexagonal Grid

  2000cited by this paper
• Fundamentals of domination in graphs

  1998cited by this paper
• On a New Class of Codes for Identifying Vertices in Graphs

  1998cited by this paper
• A Coloring Problem in Hamming Spaces

  1997cited by this paper

• On Iiro Honkala’s Contributions to Identifying Codes

  2024cites this paper
• Tolerant location detection in sensor networks

  2020cites this paper
• Locating-Domination and Identification

  2020cites this paper
• Fault Tolerant Detectors for Distinguishing Sets in Graphs

  2015cites this paper
• Automated Discharging Arguments for Density Problems in Grids

  2014cites this paper
• Minimum sizes of identifying codes in graphs differing by one vertex

  2013cites this paper
• Minimum sizes of identifying codes in graphs differing by one edge

  2013cites this paper
• On Vertex Identifying Codes For Infinite Lattices

  2011influential citation
• Tolerant identification with Euclidean balls

  2011cites this paper
• Taille minimum des codes identifiants dans les graphes différant par un sommet ou une arête Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex

  2011cites this paper
• Extension of Strongly Regular Graphs

  2008cites this paper
• On Identifying Codes in the King Grid that are Robust Against Edge Deletions

  2008cites this paper
• Identifying and Locating- Dominating Codes in Binary Hamming Spaces

  2007cites this paper
• Taille minimum des codes identi(cid:12)ants dans les graphes

  year unknowncites this paper