Hardness Complexity of Optimal Substructure Problems on Power-Law Graphs (Q2913785)

From MaRDI portal
Revision as of 09:12, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers