Pages that link to "Item:Q5189530"
From MaRDI portal
The following pages link to Spanning Directed Trees with Many Leaves (Q5189530):
Displaying 20 items.
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Some results on spanning trees (Q601948) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Leader selection for strong structural controllability of single-integrator multi-agent systems (Q1621105) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Minimum Leaf Out-Branching Problems (Q3511432) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
- Leafy spanning arborescences in DAGs (Q5918501) (← links)
- Spanning trees with many leaves (Q5919174) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)
