Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitions of graphs into one or two independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ond-threshold graphs andd-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the product knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem: an overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time / 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: Knapsack problems: a parameterized point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the number of independent sets in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708515 / 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: Q3342477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank

Latest revision as of 05:45, 23 July 2024

scientific article
Language Label Description Also known as
English
Counting and enumerating independent sets with applications to combinatorial optimization problems
scientific article

    Statements

    Counting and enumerating independent sets with applications to combinatorial optimization problems (English)
    0 references
    0 references
    0 references
    3 August 2020
    0 references
    knapsack problem
    0 references
    multidimensional knapsack problem
    0 references
    threshold graphs
    0 references
    independent sets
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references