An Amortized Search Tree Analysis for k-Leaf Spanning Tree
From MaRDI portal
Publication:3401120
DOI10.1007/978-3-642-11266-9_56zbMath1274.68675OpenAlexW1880580445MaRDI QIDQ3401120
Publication date: 28 January 2010
Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_56
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (7)
The \(k\)-leaf spanning tree problem admits a klam value of 39 ⋮ Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} ⋮ An exact exponential-time algorithm for the directed maximum leaf spanning tree problem ⋮ A 2-approximation algorithm for finding a spanning tree with maximum number of leaves ⋮ Parameterized measure \& conquer for problems with no small kernels ⋮ Enumerate and Measure: Improving Parameter Budget Management
This page was built for publication: An Amortized Search Tree Analysis for k-Leaf Spanning Tree
