Back to Search
Start Over
Branching in Digraphs with Many and Few Leaves: Structural and Algorithmic Results
- Source :
- Optimization Problems in Graph Theory ISBN: 9783319948294, Bang-Jensen, J & Gutin, G 2018, Branching in digraphs with many and few leaves : Structural and algorithmic results . in B Goldengorin (ed.), Optimization Problems in Graph Theory : In Honor of Gregory Z. Gutin's 60th Birthday . Springer, Springer Optimization and Its Applications, vol. 139, pp. 93-106 . https://doi.org/10.1007/978-3-319-94830-0_5
- Publication Year :
- 2018
- Publisher :
- Springer International Publishing, 2018.
-
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.
Details
- ISBN :
- 978-3-319-94829-4
- ISBNs :
- 9783319948294
- Database :
- OpenAIRE
- Journal :
- Optimization Problems in Graph Theory ISBN: 9783319948294, Bang-Jensen, J & Gutin, G 2018, Branching in digraphs with many and few leaves : Structural and algorithmic results . in B Goldengorin (ed.), Optimization Problems in Graph Theory : In Honor of Gregory Z. Gutin's 60th Birthday . Springer, Springer Optimization and Its Applications, vol. 139, pp. 93-106 . https://doi.org/10.1007/978-3-319-94830-0_5
- Accession number :
- edsair.doi.dedup.....404b1ba2bd6e1171c53956a5456ac3c6
- Full Text :
- https://doi.org/10.1007/978-3-319-94830-0_5