Pages that link to "Item:Q4217304"
From MaRDI portal
The following pages link to Approximating Maximum Leaf Spanning Trees in Almost Linear Time (Q4217304):
Displayed 10 items.
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- On finding spanning trees with few leaves (Q2380066) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5443382) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- Leafy spanning trees in hypercubes (Q5950587) (← links)