Abstract
AbstractAssume that a graph models a detection system for a facility with a possible “intruder,” or a multiprocessor network with a possible malfunctioning processor. We consider the problem of placing detectors at a subset of vertices in to determine the location of an intruder if there is any. Many types of detection systems have been defined for different sensor capabilities; in particular, we focus on identifying codes, where each detector can determine whether there is an intruder within its closed neighborhood. In this research we explore a fault‐tolerant variant of identifying codes applicable to real‐world systems. Specifically, error‐detecting identifying codes permit a false‐negative transmission from any single detector. We investigate minimum‐sized error‐detecting identifying codes in several classes of graphs, including cubic graphs and infinite grids, and show that the problem of determining said minimum size in arbitrary graphs is NP‐complete.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
