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

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128187555, #quickstatements; #temporary_batch_1722436439543
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00186-019-00664-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2923697280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Clique-Width for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knapsack Problem with Conflict Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of knapsack problems with conflict and forcing graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for a class of subset selection problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128187555 / rank
 
Normal rank

Latest revision as of 16:36, 31 July 2024

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

    Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (English)
    0 references
    0 references
    0 references
    10 July 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack problem
    0 references
    forcing graph
    0 references
    conflict graph
    0 references
    clique-width
    0 references
    0 references
    0 references