On Maximal Independent Arborescence Packing

Csaba Király
2016 SIAM Journal on Discrete Mathematics  
In this paper, we generalize the results of Kamiyama, Katoh and Takizawa [7] to solve the following problem. Given a digraph D = (V, A) and a matroid on an abstract set S = {s 1 , . . . , s k } along with a map π : S → V ; give k edgedisjoint arborescences T 1 , . . . , T k with roots π(s 1 ), . . . , π(s k ) such that for any v ∈ V the set {s i : v ∈ T i } is independent and its rank reaches the theoretical maximum. We also give a simplified proof for the result of Fujishige [5] from the result of Kamiyama et al.
doi:10.1137/130938396 fatcat:xcdo3qld5netzont4qhuat2kge