10 citations · 10 across the 1 of their papers we have counts for
1 paper
Hans Bodlaender, Pål G. Drange, Markus S. Dregi +3
We give an algorithm that for an input n-vertex graph G and integer k>0, in time 2^[O(k)]n either outputs that the treewidth of G is larger than k, or gives a tree decomposition of…