Pages that link to "Item:Q3189028"
From MaRDI portal
The following pages link to Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree (Q3189028):
Displaying 4 items.
- 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)
- 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)
