Identifying codes and locating-dominating sets on paths and cycles (Q642979): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0908.2750 / 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: Q4659582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871138 / 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 and locating-dominating codes: NP-completeness results for directed 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: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. / 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: Q3789614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-locating-dominating sets in paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667607 / 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: Locating sensors in paths and cycles: the case of 2-identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and location in acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of cycles with odd orders / rank
 
Normal rank

Latest revision as of 14:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Identifying codes and locating-dominating sets on paths and cycles
scientific article

    Statements

    Identifying codes and locating-dominating sets on paths and cycles (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    \(r\)-identifying codes
    0 references
    \(r\)-locating-dominating sets
    0 references
    cycles
    0 references
    paths
    0 references
    0 references
    0 references