Pages that link to "Item:Q3541089"
From MaRDI portal
The following pages link to Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089):
Displayed 6 items.
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)