Corpus ID: 46939592

Fast Dynamic Programming on Graph Decompositions

@article{Rooij2018FastDP,
  title={Fast Dynamic Programming on Graph Decompositions},
  author={Johan M. M. van Rooij and Hans L. Bodlaender and Erik Jan van Leeuwen and Peter Rossmanith and Martin Vatshelle},
  journal={ArXiv},
  year={2018},
  volume={abs/1806.01667}
}
  • Johan M. M. van Rooij, Hans L. Bodlaender, +2 authors Martin Vatshelle
  • Published in ArXiv 2018
  • Mathematics, Computer Science
  • In this paper, we consider tree decompositions, branch decompositions, and clique decompositions. We improve the running time of dynamic programming algorithms on these graph decompositions for a large number of problems as a function of the treewidth, branchwidth, or cliquewidth, respectively. On tree decompositions of width $k$, we improve the running time for Dominating Set to $O(3^k)$. We generalise this result to $[\rho,\sigma]$-domination problems with finite or cofinite $\rho$ and… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 68 REFERENCES

    Dynamic Programming and Fast Matrix Multiplication

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

    VIEW 8 EXCERPTS

    Fourier meets möbius: fast subset convolution

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    Algorithms for Vertex Partitioning Problems on Partial k-Trees

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Matrix Multiplication via Arithmetic Progressions

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Boolean-Width of Graphs

    VIEW 6 EXCERPTS

    Clique-Width is NP-Complete

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Improved Tree Decomposition Based Algorithms for Domination-like Problems

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL