@inbook{0a6dc846376a4f3ba0093dd1820c0013,

title = "Branching in digraphs with many and few leaves: Structural and algorithmic results",

abstract = "A subgraph T of a digraph D is called an out-tree if T is an oriented tree with just one vertex s of in-degree zero. A spanning out-tree is called an out-branching. A vertex x of an out-branching B is called a leaf if the out-degree of x is zero. This is a survey on out-branchings with minimum and maximum number of leaves covering both structural and algorithmic results.",

author = "J{\o}rgen Bang-Jensen and Gregory Gutin",

year = "2018",

month = sep,

doi = "10.1007/978-3-319-94830-0_5",

language = "English",

isbn = "978-3-319-94829-4",

series = "Springer Optimization and Its Applications",

publisher = "Springer",

pages = "93--106",

editor = "Boris Goldengorin",

booktitle = "Optimization Problems in Graph Theory",

address = "Germany",

}