Pages that link to "Item:Q4217304"
From MaRDI portal
The following pages link to Approximating Maximum Leaf Spanning Trees in Almost Linear Time (Q4217304):
Displaying 36 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Flow-based formulation for the maximum leaf spanning tree problem (Q324785) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← 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 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- The connected domination number of grids (Q831725) (← 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)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- Dominating complex networks by identifying minimum skeletons (Q1694056) (← links)
- Leafy spanning \(k\)-forests (Q2165258) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← 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)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- A 3-approximation algorithm for the maximum leaf \(k\)-forest problem (Q2413172) (← links)
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214) (← links)
- (Q2992654) (← links)
- Connected Domination (Q3384607) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem (Q3451414) (← links)
- (Q4500845) (← links)
- Complexity of spanning tree problems with leaf-dependent objectives (Q4887748) (← 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)
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5900911) (← links)
- Leafy spanning trees in hypercubes (Q5950587) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)