Complexity of paired domination in AT-free and planar graphs (Q2166758)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of paired domination in AT-free and planar graphs |
scientific article |
Statements
Complexity of paired domination in AT-free and planar graphs (English)
0 references
25 August 2022
0 references
domination
0 references
paired domination
0 references
planar graphs
0 references
AT-free graphs
0 references
graph algorithms
0 references
NP-completeness
0 references
approximation algorithm
0 references
0 references
0 references
