Matroid-Based Packing of Arborescences
From MaRDI portal
Publication:5300512
DOI10.1137/120883761zbMath1268.05165arXiv1207.1985OpenAlexW2062251071MaRDI QIDQ5300512
Viet Hang Nguyen, Zoltán Szigeti, Olivier Durand de Gevigney
Publication date: 27 June 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.1985
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (12)
Reachability in arborescence packings ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ Packing of spanning mixed arborescences ⋮ On packing spanning arborescences with matroid constraint ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ Covering Intersecting Bi-set Families under Matroid Constraints ⋮ On Maximal Independent Arborescence Packing ⋮ Polymatroid-based capacitated packing of branchings
This page was built for publication: Matroid-Based Packing of Arborescences
