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

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

New width parameters of graphs

M. Vatshelle
Ph.D. thesis, University of Bergen • 2012
View 1 Excerpt

J

J. Fiala
Kratochv́ıl, Locally constrained graph homomorphisms structure, complexity, and applications, Computer Science Review 2 • 2008
View 1 Excerpt

Parameterized Complexity Theory

Texts in Theoretical Computer Science. An EATCS Series • 2006
View 2 Excerpts

Similar Papers

Loading similar papers…