Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Bodlaender:
TR10-062 | 7th April 2010
Michael Elberfeld, Andreas Jakoby, Till Tantau

Logspace Versions of the Theorems of Bodlaender and Courcelle

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 composition. Courcelle's Theorem builds on Bodlaender's Theorem and states that for every monadic second-order formula $\phi$ and for
every $k$ there is ... more >>>

ISSN 1433-8092 | Imprint