Pages that link to "Item:Q513269"
From MaRDI portal
The following pages link to A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269):
Displaying 9 items.
- The connected domination number of grids (Q831725) (← links)
- Leafy spanning \(k\)-forests (Q2165258) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Connected domination in maximal outerplanar graphs (Q2192107) (← links)
- A 3-approximation algorithm for the maximum leaf \(k\)-forest problem (Q2413172) (← links)
- How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
