Counting Independent Sets in Claw-Free Graphs (Q3104779): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting models for 2SAT and 3SAT formulae / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New methods for 3-SAT decision and worst-case analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New upper bound for the \#3-SAT problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing minimal models, stable models and answer 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: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances / rank | |||
Normal rank |
Latest revision as of 18:40, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting Independent Sets in Claw-Free Graphs |
scientific article |
Statements
Counting Independent Sets in Claw-Free Graphs (English)
0 references
16 December 2011
0 references
counting problems
0 references