Abstract
For many algorithmic problems on graphs of treewidth t, a standard dynamic programming approach gives algorithms with time and space complexity 2 (*'-n ' K It turns out that when one considers the more restrictive parameter treedepth, it is often the case that a variation of this technique can be
... read more