Branching in digraphs with many and few leaves: structural and algorithmic results

DOI10.1007/978-3-319-94830-0_5MaRDI QIDQ2315577zbMATH OpenOpenAlexFDO

Authors G. Gutin, Jørgen Bang-Jensen

Publication date 25 July 2019

Full work available at URL https://doi.org/10.1007/978-3-319-94830-0_5

zbMATH Keywords

out-branchingout-tree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Out-branchings with extremal number of leaves
• Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
• Spanning directed trees with many leaves
• Better Algorithms and Bounds for Directed Maximum Leaf Problems
• Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree

Cited in

(7)

• Balanced branchings in digraphs
• Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
• Out-branchings with extremal number of leaves
• Parameterized algorithms for non-separating trees and branchings in digraphs
• scientific article; zbMATH DE number 7378329 (Why is no real title available?)
• On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
• On complexity of minimum leaf out-branching problem

This page was built for publication: Branching in digraphs with many and few leaves: structural and algorithmic results

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