Pages that link to "Item:Q847265"
From MaRDI portal
The following pages link to FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265):
Displayed 13 items.
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← 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)
- Balanced branchings in digraphs (Q2354769) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)