Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions

B. -M. Bui-Xuan, J. A. Telle, M. Vatshelle

We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rank-width, which is…