Hardness complexity of optimal substructure problems on power-law graphs (Q2913785)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hardness complexity of optimal substructure problems on power-law graphs |
scientific article; zbMATH DE number 6087351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness complexity of optimal substructure problems on power-law graphs |
scientific article; zbMATH DE number 6087351 |
Statements
Hardness Complexity of Optimal Substructure Problems on Power-Law Graphs (English)
0 references
27 September 2012
0 references
\(\rho \)-minimum dominating set
0 references
minimum dominating set
0 references
minimum vertex cover
0 references
maximum independent set
0 references
maximum clique
0 references
minimum coloring
0 references
0.9669100046157836
0 references
0.9341979026794434
0 references
0.9120197296142578
0 references
0.9115207195281982
0 references
0.8478514552116394
0 references
