Counting Independent Sets in Claw-Free Graphs (Q3104779): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-25870-1_21
+Normal rank
@@ Property / OpenAlex ID @@
+W64736712
@@ Property / OpenAlex ID: W64736712 / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Counting models for 2SAT and 3SAT formulae
@@ Property / cites work: Counting models for 2SAT and 3SAT formulae / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+New methods for 3-SAT decision and worst-case analysis
+Normal rank
@@ Property / cites work @@
+New upper bound for the \#3-SAT problem
@@ Property / cites work: New upper bound for the \#3-SAT problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computing minimal models, stable models and answer sets
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
+Normal rank