Branching in Digraphs with Many and Few Leaves: Structural and Algorithmic Results
- 847 Downloads
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.
KeywordsAlgorithmic Results Acyclic Digraph General Digraphs Input Digraph ﬁxed-parameter Tractable (FPT)
The research of Jørgen Bang-Jensen was supported by the Danish research council, grant number 1323-00178B. The research of Gregory Gutin was supported in part by Royal Society Wolfson Research Merit Award.
- 10.D. Binkele-Raible, H. Fernau, F.V. Fomin, D. Lokshtanov, S. Saurabh, Y. Villanger, Kernel(s) for problems with n kernel: on out-trees with many leaves. ACM Trans. Algorithms 9(4) (2011), article 39Google Scholar
- 13.A. Björklund, P. Kaski, I. Koutis, Directed hamiltonicity and out-branchings via generalized Laplacians, in Automata, Languages and Programming, 44th International Colloquium, ICALP 2017. Leibniz International Proceedings in Informatics (LIPIcs), vol. 80 (2017), pp. 91:1–91:14Google Scholar
- 17.J. Daligault, Combinatorial techniques for parameterized algorithms and kernels, with applications to multicut, PhD thesis, Universite Montpellier II, Montpellier, Herault, 2011Google Scholar
- 20.A. Demers, A. Downing, minimum leaf spanning tree. US Patent no. 6,105,018, August 2000Google Scholar
- 22.J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, ed. by B. Rustin (Academic Press, Cambridge, 1973), pp. 91–96Google Scholar
- 28.G. Gutin, I. Razgon, E.J. Kim, Minimum leaf out-branching problems, in AAIM’08. Lecture Notes in Computer Science, vol. 5034 (2008), pp. 235–246Google Scholar
- 30.G. Gutin, F. Reidl, M. Wahlström, k-distinct in- and out-branchings in digraphs. J. Comput. Syst. Sci. 95, 86–97 (2018)Google Scholar