Pages that link to "Item:Q5443382"
From MaRDI portal
The following pages link to A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5443382):
Displaying 8 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Spanning trees: A survey (Q659663) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← links)
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)