21 citations · 31 across the 6 of their papers we have counts for
1 paper · 1 filter
Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen +2
In this paper, we consider tree decompositions, branch decompositions, and clique decompositions. We improve the running time of dynamic programming algorithms on these graph decom…