Pages that link to "Item:Q5302044"
From MaRDI portal
The following pages link to A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044):
Displaying 7 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- Spanning trees: A survey (Q659663) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Connected Domination (Q3384607) (← links)