Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results, approximation and exact algorithms for liar's domination problem in graphs |
scientific article |
Statements
Hardness results, approximation and exact algorithms for liar's domination problem in graphs (English)
0 references
24 February 2015
0 references
graph algorithms
0 references
NP-completeness
0 references
APX-completeness
0 references
approximation algorithms
0 references
domination
0 references
liar's domination
0 references
chordal graph
0 references
