Pages that link to "Item:Q3401120"
From MaRDI portal
The following pages link to An Amortized Search Tree Analysis for k-Leaf Spanning Tree (Q3401120):
Displaying 7 items.
- 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)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)