3 citations · 5 across the 9 of their papers we have counts for
6 papers · 1 filter
Fault-Tolerant Locating-Dominating sets with Error-correction
Devin Jean, Suk Seo
A locating-dominating set is a subset of vertices representing "detectors" in a graph G; each detector monitors its closed neighborhood and can distinguish its own location from it…
Fault-Tolerant Detection Systems on the King's Grid
Devin Jean, Suk Seo
A detection system, modeled in a graph, uses "detectors" on a subset of vertices to uniquely identify an "intruder" at any vertex. We consider two types of detection systems: open-…
On Redundant Locating-Dominating Sets
Devin Jean, Suk Seo
A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and c…
Optimal Error-detection system for Identifying Codes
Devin Jean, Suk Seo
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…
Error-correcting Identifying Codes
Devin Jean, Suk Seo
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 p…
Fault-tolerant Locating-Dominating Sets on the Infinite King Grid
Devin Jean, Suk Seo
Let be a graph of a network system with vertices, , representing physical locations and edges, , representing informational connectivity. A \emph{locating-dominatin…