Parameterized Algorithms for Directed Maximum Leaf Problems

DOI10.1007/978-3-540-73420-8_32MaRDI QIDQ5428822zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Better Algorithms and Bounds for Directed Maximum Leaf Problems
• On finding directed trees with many leaves
• Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
• Tight bounds and a fast FPT algorithm for directed MAX-leaf spanning tree
• Spanning directed trees with many leaves

Cited in

(12)

• Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
• Tight bounds and a fast FPT algorithm for directed MAX-leaf spanning tree
• Minimum Leaf Out-Branching Problems
• Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
• On finding directed trees with many leaves
• On the directed degree-preserving spanning tree problem
• Spanning directed trees with many leaves
• The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
• Better Algorithms and Bounds for Directed Maximum Leaf Problems
• A new algorithm for finding trees with many leaves
• Spanning trees: A survey
• FPT algorithms and kernels for the directed k-leaf problem

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

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