Elsevier

Theoretical Computer Science

Volume 511, 4 November 2013, Pages 66-76
Theoretical Computer Science

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems

https://doi.org/10.1016/j.tcs.2013.01.009Get rights and content
Under an Elsevier user license
open archive

Abstract

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 of problem-specific equivalence relations on subsets of vertices, defined on a given decomposition tree of G. Using these algorithms all these problems become solvable in polynomial time for many well-known graph classes like interval graphs and permutation graphs (Belmonte and Vatshelle (2013)  [1]). Given a decomposition of boolean-width k we show that the algorithms will have runtime O(n42O(k2)), providing the first large class of problems solvable in fixed-parameter single-exponential time in boolean-width.

Cited by (0)

Supported by the Norwegian Research Council, project PARALGO.