Sciweavers

7 search results - page 2 / 2
» Tree-Related Widths of Graphs and Hypergraphs
Sort
View
FSTTCS
2010
Springer
13 years 3 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 3 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...