Pages that link to "Item:Q3656853"
From MaRDI portal
The following pages link to On Finding Directed Trees with Many Leaves (Q3656853):
Displaying 16 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← 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)
- 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)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- Leafy spanning \(k\)-forests (Q2165258) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)