Abstract

In this paper we give, for all constants k, l , explicit algorithms, that given a graph
G = (V, E) with a tree-decomposition of G with treewidth at most l, decide whether
the treewidth (or pathwidth) of G is at most k, and if so, find a tree-decomposition or
(path-decomposition) of G
... read more