Approximation hardness of dominating set problems in bounded degree graphs (Q958303): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:44, 5 March 2024
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
