Abstract
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a promising solution named Distance Identifying Set. The model contains Identifying Code (IC), Locating Dominating Set (LD) and their generalizations r-IC and r-LD where the closed neighborhood is considered up to distance r. It also contains Metric Dimension (MD) and its refinement r-MD in which the distance between two vertices is considered as infinite if the real distance exceeds r. Note that while IC = 1-IC and LD = 1-LD, we have MD = $$\infty$$ -MD; we say that MD is not local. In this article, we prove computational lower bounds for several problems included in Distance Identifying Set by providing generic reductions from (Planar) Hitting Set to the meta-problem. We focus on two families of problems from the meta-problem: the first one, called local, contains r-IC, r-LD and r-MD for each positive integer r while the second one, called 1-layered, contains LD, MD and r-MD for each positive integer r. We have: (1) the 1-layered problems are NP-hard even in bipartite apex graphs, (2) the local problems are NP-hard even in bipartite planar graphs, (3) assuming ETH, all these problems cannot be solved in $$2^{o(\sqrt{n})}$$ when restricted to bipartite planar or apex graph, respectively, and they cannot be solved in $$2^{o(n)}$$ on bipartite graphs, and (4) except if $${\mathsf{W}[0]} = {\mathsf{W}[2]}$$ , they do not admit parameterized algorithms in $$2^{{\mathcal {O}}(k)} \cdot n^{{\mathcal {O}}(1)}$$ even when restricted to bipartite graphs. Here k is the solution size of a relevant identifying set. In particular, Metric Dimension cannot be solved in $$2^{o(n)}$$ under ETH, answering a question of Hartung and Nichterlein (Proceedings of the 28th conference on computational complexity, CCC, 2013).
Highlights
Introduction and Corresponding WorksProblems consisting in identifying each element of a combinatorial structure with a hopefully small number of elements have been widely investigated
We prove computational lower bounds for several problems included in Distance Identifying Set by providing generic reductions from (Planar) Hitting Set to the meta-problem
We focus on two families of problem from the meta-problem: the first one, called bipartite gifted local, contains r-Identifying Code (IC), r-Locating Dominating Set (LD) and r-Metric Dimension (MD) for each positive integer r while the second one, called 1-layered, contains LD, MD and r-MD for each positive integer r
Summary
Problems consisting in identifying each element of a combinatorial structure with a hopefully small number of elements have been widely investigated. Given a distance identifying function f and a value r as a positive integer or infinity, the Distance Identifying Set meta-problem consists in finding a minimal sized r-dominating set which distinguishes every couple of vertices of an input graph thanks to the function f. We mainly focus on two natural subfamilies of problems of Distance Identifying Set named local, in which a vertex cannot discern the vertices outside of its i-neighborhood, for i a fixed positive integer, and 1-layered, where a vertex is able to separate its open neighborhood from the distant vertices With this approach, we obtain several computational lower bounds for problems included in Distance Identifying Set by providing generic reductions from (Planar) Hitting Set to the meta-problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.