A New Algorithm for Finding Trees with Many Leaves
From MaRDI portal
Recommendations
- A new algorithm for finding trees with many leaves
- A faster exact algorithm for the directed maximum leaf spanning tree problem
- On finding directed trees with many leaves
- Mathematical Foundations of Computer Science 2003
- An amortized search tree analysis for finding a \(k\)-leaf spanning tree in an undirected graph
Cited in
(18)- A new algorithm for finding trees with many leaves
- Max-leaves spanning tree is APX-hard for cubic graphs
- Mathematical Foundations of Computer Science 2003
- An exact algorithm for the maximum leaf spanning tree problem
- Enumerate and measure: improving parameter budget management
- Spotting trees with few leaves
- Spotting trees with few leaves
- On finding directed trees with many leaves
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- FPT algorithms and kernels for the directed k-leaf problem
- Digraph width measures in parameterized algorithmics
- The \(k\)-leaf spanning tree problem admits a klam value of 39
- Polynomial formulations as a barrier for reduction-based hardness proofs
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
- An amortized search tree analysis for finding a \(k\)-leaf spanning tree in an undirected graph
- An amortized search tree analysis for k-leaf spanning tree
- A faster exact algorithm for the directed maximum leaf spanning tree problem
- Parameterized measure \& conquer for problems with no small kernels
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 Q3596725)
