Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.2010.12.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051200195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive identification in graphs / 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: The minimum density of an identifying code in the king 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: Codes for identification in the king lattice / 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: On Identifying Codes in the Triangular and Square Grids / 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 codes identifying sets of vertices in Hamming spaces / 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: Q5429563 / 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: Identifying Codes and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal cardinalities for identifying and locating-dominating codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant locating-dominating sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:20, 3 July 2024

scientific article
Language Label Description Also known as
English
Identification in \(\mathbb Z^2\) using Euclidean balls
scientific article

    Statements

    Identification in \(\mathbb Z^2\) using Euclidean balls (English)
    0 references
    0 references
    0 references
    10 March 2011
    0 references
    0 references
    identifying code
    0 references
    optimal code
    0 references
    Euclidean distance
    0 references
    sensor network
    0 references
    fault diagnosis
    0 references
    0 references