2 datasets found

Using the specific structure of AT-free graphs, we give a 2-approximation algorithm for their treewidth.

We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial...