2 search results - page 1 / 1 » Logspace Versions of the Theorems of Bodlaender and Courcell... |
ECCC
2010
13 years 3 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
LATA
2012
Springer
12 years 10 days ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...