Hardness Complexity of Optimal Substructure Problems on Power-Law Graphs (Q2913785): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:12, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness Complexity of Optimal Substructure Problems on Power-Law Graphs |
scientific article |
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
