Constant-factor approximation of the domination number in sparse graphs (Q1943391): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:54, 1 February 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
