Constant-factor approximation of the domination number in sparse graphs (Q1943391): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2143305437 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1110.5190 / rank | |||
Normal rank | |||
Latest revision as of 23:55, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant-factor approximation of the domination number in sparse graphs |
scientific article |
Statements
Constant-factor approximation of the domination number in sparse graphs (English)
0 references
19 March 2013
0 references
linear-time constant-factor algorithm
0 references
proper minor-closed graph classes
0 references
proper classes closed on topological minors
0 references
