Pages that link to "Item:Q3596725"
From MaRDI portal
The following pages link to A New Algorithm for Finding Trees with Many Leaves (Q3596725):
Displaying 9 items.
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
