Parameterized Algorithms for Directed Maximum Leaf Problems

DOI10.1007/978-3-540-73420-8_32zbMath1171.68493OpenAlexW2112451853MaRDI QIDQ5428822

Michael Krivelevich, Gregory Gutin, Noga Alon, Saket Saurabh, Fedor V. Fomin

Publication date: 28 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

FPT algorithms and kernels for the directed \(k\)-leaf problem ⋮ Minimum Leaf Out-Branching Problems ⋮ A new algorithm for finding trees with many leaves ⋮ Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree ⋮ Spanning trees: A survey ⋮ Better Algorithms and Bounds for Directed Maximum Leaf Problems ⋮ Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems ⋮ On Finding Directed Trees with Many Leaves

This page was built for publication: Parameterized Algorithms for Directed Maximum Leaf Problems