Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights

DOI10.7155/jgaa.00279zbMath1254.68126MaRDI QIDQ5894785

Bart M. P. Jansen

Publication date: 7 December 2012

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00279

zbMATH Keywords

max leaf spanning tree problem; weighted max leaf

Mathematics Subject Classification ID

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms