24 citations · 124 across the 75 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DM2010★ 4 cited
Better algorithms for satisfiability problems for formulas of bounded rank-width
Robert Ganian, Petr Hliněný, Jan Obdržálek
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previo…
cs.DM2010★ 7 cited
Are there any good digraph width measures?
Robert Ganian, Petr Hliněný, Joachim Kneis +4
Several different measures for digraph width have appeared in the last few years. However, none of them shares all the "nice" properties of treewidth: First, being \emph{algorithmi…