Algorithm and hardness results on liar's dominating set and \({k}\)-tuple dominating set

DOI10.1007/978-3-030-25005-8_5zbMath1455.68133arXiv1902.11149OpenAlexW2961347594MaRDI QIDQ2301734

Sandip Banerjee, Sujoy Bhore

Publication date: 25 February 2020

Full work available at URL: https://arxiv.org/abs/1902.11149

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Balanced independent and dominating sets on colored interval graphs ⋮ Liar's domination in unit disk graphs ⋮ Statistical mechanics of the directed 2-distance minimal dominating set problem

This page was built for publication: Algorithm and hardness results on liar's dominating set and \({k}\)-tuple dominating set