Approximating the Minimum Independent Dominating Set in Perturbed Graphs (Q4925243): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_24 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1719847780 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:10, 20 March 2024
scientific article; zbMATH DE number 6174160
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the Minimum Independent Dominating Set in Perturbed Graphs |
scientific article; zbMATH DE number 6174160 |
Statements
Approximating the Minimum Independent Dominating Set in Perturbed Graphs (English)
0 references
11 June 2013
0 references
independent set
0 references
independent dominating set
0 references
dominating set
0 references
approximation algorithm
0 references
perturbed graph
0 references
smooth analysis
0 references
