A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
From MaRDI portal
Publication:3569757
DOI10.1007/978-3-642-13182-0_31zbMath1284.05267OpenAlexW1673084046MaRDI QIDQ3569757
Henning Fernau, Daniel Binkele-Raible
Publication date: 22 June 2010
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_31
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem