Connected liar's domination in graphs: complexity and algorithms (Q2874035)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6251166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connected liar's domination in graphs: complexity and algorithms |
scientific article; zbMATH DE number 6251166 |
Statements
28 January 2014
0 references
domination
0 references
liar's domination
0 references
chordal graph
0 references
graph algorithm
0 references
NP-completeness
0 references
approximation algorithm
0 references
APX-completeness
0 references
0.97485757
0 references
0 references
0 references
0.94411284
0 references
0.9413272
0 references
0.9373013
0 references
0 references
0.93099976
0 references
0.9226929
0 references
0.91638815
0 references
Connected liar's domination in graphs: complexity and algorithms (English)
0 references
