5 citations · 11 across the 10 of their papers we have counts for
Showing 2022 · cs.DMShow all
3 papers · 2 filters
cs.DM2022★ 2 cited
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…
cs.DM2022★ 3 cited
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…
cs.DM2022★ 1 cited
The NP-completeness of Redundant Open-Locating-Dominating Set
Robert Dohner, Suk Jai Seo
For a graph G, a dominating set D is a subset of vertices in G where each of the vertices in G is in D or adjacent to some vertex in D. An open-locating-dominating (OLD) set models…