Composing dynamic programming tree-decomposition-based algorithms
From MaRDI portal
(Redirected from Publication:6606983)
Recommendations
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- scientific article; zbMATH DE number 4060712
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Practical algorithms on partial k-trees with an application to domination-like problems
Cites work
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- Balanced graph partitioning
- Compatibility of unrooted phylogenetic trees is FPT
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Graph clustering
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- On the vertex arboricity of planar graphs of diameter two
- Parameterized algorithms
- Partition a graph with small diameter into two induced matchings
- Partition the vertices of a graph into induced matchings
- Reducibility among combinatorial problems
- The agreement problem for unrooted phylogenetic trees is FPT
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Treewidth of display graphs: bounds, brambles and applications
- Treewidth. Computations and approximations
- Vertex and tree arboricities of graphs
- Which problems have strongly exponential complexity?
This page was built for publication: Composing dynamic programming tree-decomposition-based algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606983)
