Reachability in arborescence packings
DOI10.1016/j.dam.2022.05.018zbMath1503.05096arXiv2006.16190OpenAlexW3037002886MaRDI QIDQ2166224
Florian Hoersch, Zoltán Szigeti
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.16190
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arc-disjoint in-trees in directed graphs
- The ellipsoid method and its consequences in combinatorial optimization
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On the orientation of graphs and hypergraphs
- Old and new results on packing arborescences in directed hypergraphs
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A matroid approach to finding edge connectivity and packing arborescences
- Minimizing submodular functions over families of sets
- Packing of arborescences with matroid constraints via matroid intersection
- Packing of maximal independent mixed arborescences
- On reachability mixed arborescence packing
- On Maximal Independent Arborescence Packing
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Matroid Intersection
- Variations for Lovász’ Submodular Ideas
- Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
- Matroid-Based Packing of Arborescences
This page was built for publication: Reachability in arborescence packings
