Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60488405, #quickstatements; #temporary_batch_1711234560214
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1206.4912 / rank
 
Normal rank

Revision as of 13:11, 18 April 2024

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
    0 references
    0 references
    0 references