Liar's dominating set problem on unit disk graphs
DOI10.1016/J.DAM.2020.01.017zbMATH Open1448.05151OpenAlexW3003325344MaRDI QIDQ2201773FDOQ2201773
Ramesh K. Jallu, Gautam K. Das
Publication date: 17 September 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.017
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Approximation schemes for covering and packing problems in image processing and VLSI
- \(k\)-tuple domination in graphs
- Liar's domination in graphs
- Liar's dominating set in unit disk graphs
- Liar's domination in graphs: complexity and algorithm
- A linear time algorithm for liar's domination problem in proper interval graphs
- Liar's domination
- Liar's dominating sets in graphs
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
Cited In (4)
This page was built for publication: Liar's dominating set problem on unit disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201773)
