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

From MaRDI portal
Revision as of 00:02, 24 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60488405, #quickstatements; #temporary_batch_1711234560214)
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