4 datasets found

International audience

We show that for a graph $G$ on $n$ vertices its treewidth can be computed in $\mathcal{O}(poly(n) 1.9601^n)$ time. Our result is based on combinatorial upper bounds...

Minimal triangulations and potential maximal cliques are main ingredients for a number of polynomial time algorithms computing the treewidth for different graph...

This report focuses on the challenging issue of designing exponential algorithms for scheduling problems. Despite a growing literature dealing with such algorithms for...