The algorithmic complexity of mixed domination in graphs (Q533883): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5886219 / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed domination
Property / zbMATH Keywords: mixed domination / rank
 
Normal rank
Property / zbMATH Keywords
 
tree
Property / zbMATH Keywords: tree / rank
 
Normal rank
Property / zbMATH Keywords
 
split graph
Property / zbMATH Keywords: split graph / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-complete
Property / zbMATH Keywords: NP-complete / rank
 
Normal rank

Revision as of 09:32, 1 July 2023

scientific article
Language Label Description Also known as
English
The algorithmic complexity of mixed domination in graphs
scientific article

    Statements

    The algorithmic complexity of mixed domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed domination
    0 references
    tree
    0 references
    split graph
    0 references
    algorithm
    0 references
    NP-complete
    0 references