Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940)
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: Algorithmic aspects of b-disjunctive domination in graphs |
scientific article; zbMATH DE number 6909084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of \(b\)-disjunctive domination in graphs |
scientific article; zbMATH DE number 6909084 |
Statements
Algorithmic aspects of \(b\)-disjunctive domination in graphs (English)
0 references
20 July 2018
0 references
domination
0 references
chordal graph
0 references
graph algorithm
0 references
approximation algorithm
0 references
NP-complete
0 references
APX-complete
0 references
0 references
0.936881959438324
0 references
0.9009547829627992
0 references
0.8333641290664673
0 references
0.8209806680679321
0 references
0.8190779685974121
0 references
