The \(k\)-leaf spanning tree problem admits a klam value of 39
From MaRDI portal
Publication:1678098
DOI10.1016/j.ejc.2017.07.018zbMath1373.05040arXiv1502.07725OpenAlexW2962875076MaRDI QIDQ1678098
Publication date: 14 November 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.07725
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Fundamentals of parameterized complexity
- Improved bounds for spanning trees with many leaves
- A new algorithm for finding trees with many leaves
- FPT algorithms and kernels for the directed \(k\)-leaf problem
- NP-completeness and degree restricted spanning trees
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- The k-Leaf Spanning Tree Problem Admits a Klam Value of 39
- An Amortized Search Tree Analysis for k-Leaf Spanning Tree
- A New Algorithm for Finding Trees with Many Leaves
- Mathematical Foundations of Computer Science 2003
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
- Parameterized Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The \(k\)-leaf spanning tree problem admits a klam value of 39