A new algorithm for finding trees with many leaves
DOI10.1007/S00453-010-9454-5zbMATH Open1230.68112OpenAlexW2087477484MaRDI QIDQ652536FDOQ652536
Authors: Joachim Kneis, Alexander Langer, Peter Rossmanith 
Publication date: 14 December 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://publications.rwth-aachen.de/record/47970
Recommendations
graph algorithmsdirected maximum-leaf out-branchingdirected maximum-leaf out-treeout-branchingsout-trees
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- A short note on the approximability of the maximum leaves spanning tree problem
- Which problems have strongly exponential complexity?
- Graph minors. XIII: The disjoint paths problem
- An approximation algorithm for the maximum leaf spanning arborescence problem
- Spanning Trees with Many Leaves
- Limits and Applications of Group Algebras for Parameterized Problems
- Title not available (Why is that?)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
- Digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Linear Time Minor Tests with Depth-First Search
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- FPT algorithms and kernels for the directed \(k\)-leaf problem
- Spanning directed trees with many leaves
- Solving connected dominating set faster than \(2^n\)
- Tight bounds and a fast FPT algorithm for directed MAX-leaf spanning tree
- On finding directed trees with many leaves
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Mathematical Foundations of Computer Science 2003
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
- \(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves
- Minimum Leaf Out-Branching Problems
- Title not available (Why is that?)
- Parameterized Algorithms for Directed Maximum Leaf Problems
- Better Algorithms and Bounds for Directed Maximum Leaf Problems
Cited In (15)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Improved bounds for spanning trees with many leaves
- Mathematical Foundations of Computer Science 2003
- \(k\)-distinct in- and out-branchings in digraphs
- Finding \(k\)-secluded trees faster
- Finding \(k\)-secluded trees faster
- Spotting trees with few leaves
- Spotting trees with few leaves
- On finding directed trees with many leaves
- Parameterized complexity of multi-node hubs
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- The \(k\)-leaf spanning tree problem admits a klam value of 39
- A faster exact algorithm for the directed maximum leaf spanning tree problem
- A New Algorithm for Finding Trees with Many Leaves
- Parameterized complexity of multi-node hubs
This page was built for publication: A new algorithm for finding trees with many leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652536)
