Liar's dominating set problem on unit disk graphs
From MaRDI portal
(Redirected from Publication:2201773)
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A linear time algorithm for liar's domination problem in proper interval graphs
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
- Approximation schemes for covering and packing problems in image processing and VLSI
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- Liar's dominating set in unit disk graphs
- Liar's dominating sets in graphs
- Liar's domination
- Liar's domination in graphs
- Liar's domination in graphs: complexity and algorithm
- \(k\)-tuple domination in graphs
Cited in
(6)
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)