Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056104224 / rank | |||
Normal rank | |||
Revision as of 14:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Domination in graphs with bounded propagation: Algorithms, formulations and hardness results |
scientific article |
Statements
Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (English)
0 references
13 August 2010
0 references
dominating set
0 references
Ppower dominating set
0 references
planar graphs
0 references
approximation algorithms
0 references
PTAS
0 references
hardness of approximation
0 references
tree-width
0 references
integer programming
0 references
