Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126)

From MaRDI portal
Revision as of 15:36, 31 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128187555, #quickstatements; #temporary_batch_1722436439543)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
scientific article

    Statements

    title
    Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (English)
    0 references
    author
    Frank Gurski
    0 references
    Carolin Rehs
    0 references
    publication date
    10 July 2019
    0 references
    zbMATH Keywords
    knapsack problem
    0 references
    forcing graph
    0 references
    conflict graph
    0 references
    clique-width
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    90C39
    0 references
    90C27
    0 references
    05C69
    0 references
    zbMATH DE Number
    7078304
    0 references
    OpenAlex ID
    W2923697280
    0 references
    Wikidata QID
    Q128187555
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2311126&oldid=37495531"
    Powered by MediaWiki