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

From MaRDI portal
Revision as of 15:59, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Preprocessing subgraph and minor problems: when does a small vertex cover help?
scientific article

    Statements

    title
    Preprocessing subgraph and minor problems: when does a small vertex cover help? (English)
    0 references
    author
    Fedor V. Fomin
    0 references
    Bart M. P. Jansen
    0 references
    Michał Pilipczuk
    0 references
    publication date
    13 December 2013
    0 references
    zbMATH Keywords
    kernelization complexity
    0 references
    parameterization by vertex cover
    0 references
    cites work
    (Meta) Kernelization
    0 references
    Q3113681
    0 references
    Induced matchings
    0 references
    Q3577833
    0 references
    Q4393480
    0 references
    Q4198056
    0 references
    Q3086928
    0 references
    Q3113682
    0 references
    Q5743380
    0 references
    Q5710169
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C85
    0 references
    05C70
    0 references
    05C15
    0 references
    zbMATH DE Number
    6238127
    0 references
    OpenAlex ID
    W2080609813
    0 references
    Wikidata QID
    Q60488405
    0 references
    arXiv ID
    1206.4912
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q386050&oldid=38327343"
    Powered by MediaWiki