Year: 2022
Type: preprint
Abstract: Assume that a graph $G$ 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 (the minimum number of) detectors at a subset of vertices in $G$ to automatically determine if there is an intruder, and if so, its precise location. In this research we explore a fault-tolerant variant of identifying codes, known as error-correcting identifying codes, which permit one false positive or negative and are applicable to real-world systems. We present the proof of NP-completeness of the problem of determining said minimum size in arbitrary graphs, and determine bounds on the parameter in cubic graphs.
Source: arXiv (Cornell University)
Authors: Jean, Devin, Seo, Suk
Institutions: Middle Tennessee State University, Vanderbilt University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4224939673