On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Moreover, this tree decomposition is used to compute a flower decomposition (with l = 90), which gives additional features: size of the root cluster, Cartesian product of the sizes

and Canada (Winston et al. We conducted a pairwise competition experiment to specifically explore whether i) plant species co-occurring with C. stoebe in Europe and North

We describe a simple conditional lower bound that, for any constant > 0, an O(|E| 1− m)-time or an O(|E| m 1− )-time algorithm for exact pattern matching on graphs, with node

Concerning the approximability of related problems, Hassin and Rubinstein, [9] pro- posed a generic algorithm to approximate MaxW P 4 Packing in complete graphs on 4n vertices

Given a graph G and a complete list B G of blocks together with their block branch-widths, the branch-width of G can be computed in O(nm|B G |) time.. The last tool we need to be

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come

This paper is organized as follows: in the next section, we will briefly present previous related work about the hardness of solving bounded-size-path packing problems; then, the

A b-coloring of a graph G by k colors is a proper coloring of the vertices of G such that every color class contains a vertex that is adjacent to all the other k− 1 color classes..