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.07725MaRDI 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
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05C85: Graph algorithms (graph-theoretic aspects)