A New Algorithm for Finding Trees with Many Leaves
From MaRDI portal
Publication:3596725
DOI10.1007/978-3-540-92182-0_26zbMath1183.05082OpenAlexW2107372402MaRDI QIDQ3596725
Joachim Kneis, Alexander Langer, Peter Rossmanith
Publication date: 29 January 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://publications.rwth-aachen.de/record/47970
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
FPT algorithms and kernels for the directed \(k\)-leaf problem ⋮ The \(k\)-leaf spanning tree problem admits a klam value of 39 ⋮ Max-leaves spanning tree is APX-hard for cubic graphs ⋮ Digraph width measures in parameterized algorithmics ⋮ An exact algorithm for the maximum leaf spanning tree problem ⋮ Parameterized measure \& conquer for problems with no small kernels ⋮ Enumerate and Measure: Improving Parameter Budget Management ⋮ Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems ⋮ On Finding Directed Trees with Many Leaves
This page was built for publication: A New Algorithm for Finding Trees with Many Leaves
