Composing dynamic programming tree-decomposition-based algorithms
Given two parad bhasma price integers $ell$ and $p$ as well as $ell$ graph classes $mathcal{H}_1,ldots,mathcal{H}_ell$, the problems $mathsf{GraphPart}(mathcal{H}_1, ldots, mathcal{H}_ell,p)$, reak $mathsf{VertPart}(mathcal{H}_1, ldots, mathcal{H}_ell)$, and $mathsf{EdgePart}(mathcal{H}_1, ldots, mathcal{H}_ell)$ ask, given graph $G$ as input, whe