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

@article{BuiXuan2013FastDP,
title={Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems},
author={Binh-Minh Bui-Xuan and Jan Arne Telle and Martin Vatshelle},
journal={Theor. Comput. Sci.},
year={2013},
volume={511},
pages={66-76}
}

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 [1]). Given… CONTINUE READING