Satisfiability of acyclic and almost acyclic CNF formulas (Q385062): Difference between revisions

@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463359
@@ Property / cites work: Q5463359 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037313
@@ Property / cites work: Q4037313 / rank @@
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of acyclicity for hypergraphs and relational database schemes
+Normal rank
@@ Property / cites work @@
+Counting truth assignments of formulas of bounded tree-width or clique-width
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q2908838
@@ Property / cites work: Q2908838 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4779133
@@ Property / cites work: Q4779133 / rank @@
+Normal rank
@@ Property / cites work @@
+Hypertree decompositions and tractable queries
@@ Property / cites work: Hypertree decompositions and tractable queries / rank @@
+Normal rank
@@ Property / cites work @@
+Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
+Normal rank
@@ Property / cites work @@
+Q4246749
@@ Property / cites work: Q4246749 / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal deletion is fixed-parameter tractable
@@ Property / cites work: Chordal deletion is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Solving \#SAT using vertex covers
@@ Property / cites work: Solving \#SAT using vertex covers / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+Algorithms for propositional model counting
@@ Property / cites work: Algorithms for propositional model counting / rank @@
+Normal rank
@@ Property / cites work @@
+On finding solutions for extended Horn formulas
@@ Property / cites work: On finding solutions for extended Horn formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4737226
@@ Property / cites work: Q4737226 / rank @@
+Normal rank