An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
From MaRDI portal
Publication:6201339
Recommendations
- Sharp separation and applications to exact and parameterized algorithms
- Fixed-parameter tractability results for full-degree spanning tree and its dual
- On the parameterized complexity of spanning trees with small vertex covers
- Improved Steiner tree algorithms for bounded treewidth
- Sharp separation and applications to exact and parameterized algorithms
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2086635 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- A \(c^k n\) 5-approximation algorithm for treewidth
- A generalization of the minimum branch vertices spanning tree problem
- A note on the prize collecting traveling salesman problem
- Bottleneck Steiner tree with bounded number of Steiner vertices
- Easy problems for tree-decomposable graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Improved Steiner tree algorithms for bounded treewidth
- On finding spanning trees with few leaves
- On the edge capacitated Steiner tree problem
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Packing element-disjoint steiner trees
- Parameterized algorithms
- Spanning Trees—Short or Small
- Tractable cases of the extended global cardinality constraint
- Treewidth. Computations and approximations
This page was built for publication: An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201339)
