An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth

DOI10.1016/j.tcs.2024.114406OpenAlexW4391179559WikidataQ129496685 ScholiaQ129496685MaRDI QIDQ6201339

Dimitri Watel, Julien Baste

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

zbMATH Keywords

graph algorithmtreewidthfixed-parameter tractable algorithmspanning tree problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the prize collecting traveling salesman problem
• On the parameterized complexity of multiple-interval graph problems
• Treewidth. Computations and approximations
• A generalization of the minimum branch vertices spanning tree problem
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
• Improved Steiner tree algorithms for bounded treewidth
• On the edge capacitated Steiner tree problem
• Bottleneck Steiner tree with bounded number of Steiner vertices
• On finding spanning trees with few leaves
• Tractable cases of the extended global cardinality constraint
• A $c^k n$ 5-Approximation Algorithm for Treewidth
• Edge-Disjoint Spanning Trees of Finite Graphs
• Easy problems for tree-decomposable graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Spanning Trees—Short or Small
• Packing element-disjoint steiner trees
• Parameterized Algorithms

This page was built for publication: An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth