On robust identification in the square and King grids (Q860410): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.dam.2006.03.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069819456 / 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: Bounds on identifying codes / 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: The minimum density of an identifying code in the king lattice. / 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: New bounds for codes identifying vertices in graphs / 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: Q2717197 / 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: On robust and dynamic identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the identification of sets of points in the square lattice / 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 a new class of identifying codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On identification in the triangular grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of identifying codes in the square lattice / 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: Q5437393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes / rank
 
Normal rank

Latest revision as of 11:05, 25 June 2024

scientific article
Language Label Description Also known as
English
On robust identification in the square and King grids
scientific article

    Statements

    On robust identification in the square and King grids (English)
    0 references
    0 references
    9 January 2007
    0 references
    multiprocessor system
    0 references
    fault diagnosis
    0 references
    robust identification
    0 references
    optimal code
    0 references

    Identifiers