Spotting Trees with Few Leaves

DOI10.1007/978-3-662-47672-7_20zbMath1441.68066arXiv1501.00563MaRDI QIDQ3448789

Meirav Zehavi, Andreas Björklund, Łukasz Kowalik, Vikram Kamat

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.00563

Mathematics Subject Classification ID

68W40: Analysis of algorithms

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

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