Approximation hardness of dominating set problems in bounded degree graphs (Q958303)
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: Approximation hardness of dominating set problems in bounded degree graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation hardness of dominating set problems in bounded degree graphs |
scientific article |
Statements
Approximation hardness of dominating set problems in bounded degree graphs (English)
0 references
3 December 2008
0 references
Maximum Induced Matching
0 references
Maximum Leaf Spanning Tree
0 references
