NP-completeness and APX-completeness of restrained domination in graphs (Q442103): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Lei Chen / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064501 / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-complete
Property / zbMATH Keywords: NP-complete / rank
 
Normal rank
Property / zbMATH Keywords
 
APX-complete
Property / zbMATH Keywords: APX-complete / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation ratio
Property / zbMATH Keywords: approximation ratio / rank
 
Normal rank
Property / zbMATH Keywords
 
domination problems
Property / zbMATH Keywords: domination problems / rank
 
Normal rank
Property / zbMATH Keywords
 
restrained domination
Property / zbMATH Keywords: restrained domination / rank
 
Normal rank

Revision as of 01:18, 30 June 2023

scientific article
Language Label Description Also known as
English
NP-completeness and APX-completeness of restrained domination in graphs
scientific article

    Statements

    NP-completeness and APX-completeness of restrained domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 August 2012
    0 references
    NP-complete
    0 references
    APX-complete
    0 references
    approximation ratio
    0 references
    domination problems
    0 references
    restrained domination
    0 references

    Identifiers