In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the detailsâ€¦ (More)

This paper shows how a general technique, called lock-step search, used in dynamic graph algorithms, can be used to improve the running time of two problems arising in program veriication andâ€¦ (More)

Given a graph G we provide dynamic programming algorithms for many locally checkable vertex subset and vertex partitioning problems. Their runtime is polynomial in the number of equivalence classesâ€¦ (More)

For an arbitrary lled graph G + of a given original graph G, we consider the problem of removing ll edges from G + in order to obtain a graph M that is both a minimal lled graph of G and a subgraphâ€¦ (More)

A covering projection from a graph G onto a graph H is a \local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v 2 V (G), the neighborhood of v isâ€¦ (More)

Boolean-width is a recently introduced graph invariant. Similar to tree-width, it measures the structural complexity of graphs. Given any graph G and a decomposition of G of boolean-width k , we giveâ€¦ (More)

Many graph parameters are the optimal value of an objective function over selected subsets S of vertices with some constraint on how many selected neighbors vertices in S, and vertices not in S, canâ€¦ (More)