Error-correcting Identifying Codes
From MaRDI portal
Publication:6397339
Abstract: Assume 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 (the minimum number of) detectors at a subset of vertices in 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.
This page was built for publication: Error-correcting Identifying Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397339)
