A New Algorithm for Finding Trees with Many Leaves

  title={A New Algorithm for Finding Trees with Many Leaves},
  author={Joachim Kneis and Alexander Langer and Peter Rossmanith},

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 25 extracted citations

Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems

Electronic Notes in Discrete Mathematics • 2009
View 5 Excerpts
Highly Influenced

Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights

J. Graph Algorithms Appl. • 2012
View 4 Excerpts
Highly Influenced

Parameterized Algorithms

Springer International Publishing • 2015

Similar Papers

Loading similar papers…