A New Algorithm for Finding Trees with Many Leaves

DOI10.1007/978-3-540-92182-0_26zbMath1183.05082MaRDI 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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Max-leaves spanning tree is APX-hard for cubic graphs, An exact algorithm for the maximum leaf spanning tree problem, FPT algorithms and kernels for the directed \(k\)-leaf problem, The \(k\)-leaf spanning tree problem admits a klam value of 39, Parameterized measure \& conquer for problems with no small kernels, Digraph width measures in parameterized algorithmics, Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems, Enumerate and Measure: Improving Parameter Budget Management, On Finding Directed Trees with Many Leaves