Counting Maximal Independent Sets in Subcubic Graphs (Q2891379): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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/978-3-642-27660-6_27 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W111187085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044360 / rank
 
Normal rank
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: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Counting 2-Sat Solutions and Colorings with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two techniques of combining branching and treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Sets and Bicliques in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Independent Sets in Claw-Free Graphs / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Counting Maximal Independent Sets in Subcubic Graphs
scientific article

    Statements

    Counting Maximal Independent Sets in Subcubic Graphs (English)
    0 references
    15 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references