Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334)
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 6286047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of the \(k\)-domination problem in graphs |
scientific article; zbMATH DE number 6286047 |
Statements
Algorithmic aspects of the \(k\)-domination problem in graphs (English)
0 references
16 April 2014
0 references
\(k\)-domination
0 references
tree
0 references
block graph
0 references
cactus
0 references
block-cactus graph
0 references
split graph
0 references
algorithm
0 references
NP-complete
0 references
0 references
0.8747173547744751
0 references
0.8682118654251099
0 references
0.8488090634346008
0 references
0.8379644155502319
0 references
