An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
From MaRDI portal
Publication:6201339
DOI10.1016/J.TCS.2024.114406OpenAlexW4391179559WikidataQ129496685 ScholiaQ129496685MaRDI QIDQ6201339FDOQ6201339
Authors: Julien Baste, Dimitri Watel 
Publication date: 20 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114406
Cites Work
- Title not available (Why is that?)
- Tractable cases of the extended global cardinality constraint
- Edge-Disjoint Spanning Trees of Finite Graphs
- Easy problems for tree-decomposable graphs
- Parameterized algorithms
- Graph minors. II. Algorithmic aspects of tree-width
- Treewidth. Computations and approximations
- A note on the prize collecting traveling salesman problem
- Title not available (Why is that?)
- 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
- On finding spanning trees with few leaves
- Title not available (Why is that?)
- Spanning Trees—Short or Small
- A \(c^k n\) 5-approximation algorithm for treewidth
- A generalization of the minimum branch vertices spanning tree problem
- On the edge capacitated Steiner tree problem
- Improved Steiner tree algorithms for bounded treewidth
- Bottleneck Steiner tree with bounded number of Steiner vertices
- Packing element-disjoint steiner trees
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)
