Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2006.12.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040878396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete sensor placement problems in distribution networks / 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: Bounds on identifying codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871138 / 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: 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: Q2717197 / 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: Q3789614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of codes identifying sets of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of cycles / 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: Q3684148 / 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: Fault-tolerant locating-dominating sets / rank
 
Normal rank

Latest revision as of 13:43, 27 June 2024

scientific article
Language Label Description Also known as
English
Locating sensors in paths and cycles: the case of 2-identifying codes
scientific article

    Statements

    Locating sensors in paths and cycles: the case of 2-identifying codes (English)
    0 references
    0 references
    0 references
    30 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph theoretic distance
    0 references
    sensor placement in networks
    0 references
    fault detection/localization in multiprocessor or distributed systems
    0 references
    0 references