A faster exact algorithm for the directed maximum leaf spanning tree problem

DOI10.1007/978-3-642-13182-0_31zbMATH Open1284.05267OpenAlexW1673084046MaRDI QIDQ3569757FDOQ3569757

Authors: Daniel Binkele-Raible, Henning Fernau 

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

Recommendations

• An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
• An exact algorithm for the maximum leaf spanning tree problem
• An exact algorithm for the maximum leaf spanning tree problem
• A new algorithm for finding trees with many leaves
• A New Algorithm for Finding Trees with Many Leaves

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited In (7)

• A new algorithm for finding trees with many leaves
• An exact algorithm for the maximum leaf spanning tree problem
• An exact algorithm for the maximum leaf spanning tree problem
• An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
• FPT algorithms and kernels for the directed \(k\)-leaf problem
• An approximation algorithm for the maximum leaf spanning arborescence problem
• A New Algorithm for Finding Trees with Many Leaves

This page was built for publication: A faster exact algorithm for the directed maximum leaf spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569757)