Parameterized complexity of vertex deletion into perfect graph classes (Q392038): 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: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244637 / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect graphs
Property / zbMATH Keywords: perfect graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex deletion problems
Property / zbMATH Keywords: vertex deletion problems / rank
 
Normal rank
Property / zbMATH Keywords
 
kernelization
Property / zbMATH Keywords: kernelization / rank
 
Normal rank

Revision as of 14:21, 29 June 2023

scientific article
Language Label Description Also known as
English
Parameterized complexity of vertex deletion into perfect graph classes
scientific article

    Statements

    Parameterized complexity of vertex deletion into perfect graph classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    parameterized complexity
    0 references
    perfect graphs
    0 references
    vertex deletion problems
    0 references
    kernelization
    0 references

    Identifiers