2017-08-01
On packing spanning arborescences with matroid constraint
Publication
Publication
Electronic Notes in Discrete Mathematics , Volume 61 p. 451- 457
Additional Metadata | |
---|---|
connectivity, Edmonds’ branching theorem, matroid, packing arborescences | |
dx.doi.org/10.1016/j.endm.2017.06.073 | |
Electronic Notes in Discrete Mathematics | |
Organisation | Centrum Wiskunde & Informatica, Amsterdam, The Netherlands |
Fortier, Q, Király, C, Szigeti, Z, & Tanigawa, S.-I. (2017). On packing spanning arborescences with matroid constraint. Electronic Notes in Discrete Mathematics, 61, 451–457. doi:10.1016/j.endm.2017.06.073
|