Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hardness results and approximation algorithm for total liar's domination in graphs |
scientific article; zbMATH DE number 6307080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness results and approximation algorithm for total liar's domination in graphs |
scientific article; zbMATH DE number 6307080 |
Statements
Hardness results and approximation algorithm for total liar's domination in graphs (English)
0 references
24 June 2014
0 references
domination
0 references
liar's domination
0 references
chordal graph
0 references
graph algorithm
0 references
approximation algorithm
0 references
NP-completeness
0 references
APX-completeness
0 references
0.9116531014442444
0 references
0.8865842819213867
0 references
0.8862674832344055
0 references
0.8273253440856934
0 references
0.8222988247871399
0 references
