1 paper · 1 filter
Mahdi Belbasi, Martin Fürer
We present a new approximation algorithm for the treewidth problem which finds an upper bound on the treewidth and constructs a corresponding tree decomposition as well. Our algori…