Parameterized complexity of critical node cuts (Q517024)

From MaRDI portal
Revision as of 13:59, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized complexity of critical node cuts
scientific article

    Statements

    title
    Parameterized complexity of critical node cuts (English)
    0 references
    author
    Danny Hermelin
    0 references
    Moshe Kaspi
    0 references
    Christian Komusiewicz
    0 references
    Barak Navon
    0 references
    publication date
    16 March 2017
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C40
    0 references
    05C85
    0 references
    zbMATH DE Number
    6695315
    0 references
    zbMATH Keywords
    graph cut problems
    0 references
    treewidth
    0 references
    kernelization
    0 references
    OpenAlex ID
    W1621893734
    0 references
    cites work
    Q4291429
    0 references
    Multicut is FPT
    0 references
    Q4393480
    0 references
    Q3032280
    0 references
    Q4198056
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q517024&oldid=36310968"
    Powered by MediaWiki