Error-correcting Identifying Codes

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...

Full description

Saved in:
Bibliographic Details
Main Authors Jean, Devin, Seo, Suk
Format Journal Article
LanguageEnglish
Published 24.04.2022
Subjects
Computer Science - Discrete Mathematics
Mathematics - Combinatorics
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.48550/arxiv.2204.11362