Pages that link to "Item:Q5458844"
From MaRDI portal
The following pages link to Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844):
Displaying 6 items.
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- Spanning trees: A survey (Q659663) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- Minimum Leaf Out-Branching Problems (Q3511432) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
