Combinatorics for smaller kernels: the differential of a graph (Q476877)

From MaRDI portal
Revision as of 15:41, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/tcs/BermudoF15, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Combinatorics for smaller kernels: the differential of a graph
scientific article

    Statements

    title
    Combinatorics for smaller kernels: the differential of a graph (English)
    0 references
    author
    Sergio Bermudo
    0 references
    Henning Fernau
    0 references
    publication date
    2 December 2014
    0 references
    zbMATH Keywords
    parameterized algorithm
    0 references
    kernelization
    0 references
    approximation algorithm
    0 references
    combinatorial bounds
    0 references
    differential of a graph
    0 references
    cites work
    Q4393480
    0 references
    Q5488331
    0 references

    Identifiers

    zbMATH DE Number
    6375987
    0 references
    Wikidata QID
    Q59864906
    0 references
    OpenAlex ID
    W2042274748
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q476877&oldid=37907475"
    Powered by MediaWiki