Pages that link to "Item:Q2896380"
From MaRDI portal
The following pages link to Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs (Q2896380):
Displayed 4 items.
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)