Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
On the Relationship Between Clique-Width and Treewidth
SIAM Journal on Computing
A Parametrized Algorithm for Matroid Branch-Width
SIAM Journal on Computing
Journal of Combinatorial Theory Series B
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Rank-width is less than or equal to branch-width
Journal of Graph Theory
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
Graph operations characterizing rank-width
Discrete Applied Mathematics
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
Algorithms for propositional model counting
Journal of Discrete Algorithms
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Solving MAX-r-SAT Above a Tight Lower Bound
Algorithmica
The Rank-Width of Edge-Coloured Graphs
Theory of Computing Systems
Hi-index | 0.00 |
We provide a parameterized algorithm for the propositional model counting problem #SAT, the runtime of which has a single-exponential dependency on the rank-width of the signed graph of a formula. That is, our algorithm runs in time $\cal{O}t^3 \cdot 2^{3tt+1/2} \cdot \vert\phi\vert$ for a width-t rank-decomposition of the input φ, and can be of practical interest for small values of rank-width. Previously, analogical algorithms have been known --e.g. [Fischer, Makowsky, and Ravve] --with a single-exponential dependency on the clique-width k of the signed graph of a formula with a given k-expression. Our algorithm presents an exponential runtime improvement over the worst-case scenario of the previous one, since clique-width reaches up to exponentially higher values than rankwidth. We also provide an algorithm for the MAX-SAT problem along the same lines.