Algorithmic aspects of disjunctive domination in graphs (Q3196396)
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 disjunctive domination in graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of disjunctive domination in graphs |
scientific article |
Statements
Algorithmic Aspects of Disjunctive Domination in Graphs (English)
0 references
29 October 2015
0 references
domination
0 references
chordal graph
0 references
graph algorithm
0 references
approximation algorithm
0 references
NP-completeness
0 references
APX-completeness
0 references
0.936881959438324
0 references
0.8681159615516663
0 references
0.863746166229248
0 references
0.8188869953155518
0 references
