Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050): 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: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6238127 / rank
 
Normal rank
Property / zbMATH Keywords
 
kernelization complexity
Property / zbMATH Keywords: kernelization complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterization by vertex cover
Property / zbMATH Keywords: parameterization by vertex cover / rank
 
Normal rank

Revision as of 12:53, 29 June 2023

scientific article
Language Label Description Also known as
English
Preprocessing subgraph and minor problems: when does a small vertex cover help?
scientific article

    Statements

    Preprocessing subgraph and minor problems: when does a small vertex cover help? (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2013
    0 references
    kernelization complexity
    0 references
    parameterization by vertex cover
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references