On identifying codes that are robust against edge changes (Q2373878): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1261013
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Iiro S. Honkala / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2007.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995498805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Minimum Density of Codes Identifying Vertices in the Square Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and locating-dominating codes on chains and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: General bounds for identifying codes in some infinite regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes with small radius in some infinite regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Codes Identifying Vertices in the Hexagonal Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes identifying vertices in the two-dimensional square lattice with diagonals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal edge-robust identifying code in the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal locating-dominating set in the infinite triangular grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of optimal identifying codes in \(\mathbb Z^2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3412137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust and dynamic identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes for identification in the king lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Identifying Codes in the Triangular and Square Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identifying codes in the hexagonal mesh / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating--dominating sets in infinite grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3094530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identifying codes in the King grid that are robust against edge deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identifying codes in binary Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit sphere packings and coverings of the Hamming space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a new class of codes for identifying vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of optimal identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal codes for strong identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5437393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust identification in the square and King grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of optimal codes for strong identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coloring problem in Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant locating-dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear codes with covering radius two and three / rank
 
Normal rank

Latest revision as of 12:17, 26 June 2024

scientific article
Language Label Description Also known as
English
On identifying codes that are robust against edge changes
scientific article

    Statements

    On identifying codes that are robust against edge changes (English)
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    identifying code
    0 references
    fault tolerance
    0 references
    robustness
    0 references
    edge changes
    0 references
    optimal code
    0 references
    multiprocessor system
    0 references
    undirected graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references