The following pages link to (Q4252040):
Displayed 22 items.
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- Optimal wake-up scheduling of data gathering trees for wireless sensor networks (Q433434) (← 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)
- 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)
- Connected domination of regular graphs (Q1025488) (← links)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384) (← links)
- On finding spanning trees with few leaves (Q2380066) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← 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)
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- Leafy spanning trees in hypercubes (Q5950587) (← links)