Approximation hardness of dominating set problems in bounded degree graphs (Q958303): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094067618 / rank | |||
Normal rank | |||
Revision as of 22:03, 19 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
