Complexity of distance paired-domination problem in graphs (Q1758170)
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: Complexity of distance paired-domination problem in graphs |
scientific article; zbMATH DE number 6103625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of distance paired-domination problem in graphs |
scientific article; zbMATH DE number 6103625 |
Statements
Complexity of distance paired-domination problem in graphs (English)
0 references
8 November 2012
0 references
distance \(k\)-dominating set
0 references
distance \(k\)-paired-dominating set
0 references
strongly chordal graph
0 references
undirected path graph
0 references
NP-complete
0 references
approximation algorithm
0 references
APX-complete
0 references
0 references
0 references
0.8608117699623108
0 references
0.8372495770454407
0 references
0.8354387283325195
0 references
0.8347588181495667
0 references
0.8304205536842346
0 references
