Complexity of distance paired-domination problem in graphs (Q1758170): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092122769 / rank | |||
Normal rank | |||
Revision as of 02:22, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of distance paired-domination problem in graphs |
scientific article |
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
