Old and new results on packing arborescences in directed hypergraphs
DOI10.1016/J.DAM.2017.11.004zbMATH Open1384.05119OpenAlexW2770437345MaRDI QIDQ1744239FDOQ1744239
Authors: Quentin Fortier, Csaba Király, Marion Léonard, Zoltán Szigeti, Alexandre Talon 
Publication date: 20 April 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.11.004
Recommendations
- Reachability in arborescence packings
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Matroid-Based Packing of Arborescences
- Packing of arborescences with matroid constraints via matroid intersection
- Packing of mixed hyperarborescences with flexible roots via matroid intersection
Directed graphs (digraphs), tournaments (05C20) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65)
Cites Work
- Connections in combinatorial optimization
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- Packing arborescences
- Variations for Lovász’ Submodular Ideas
- On the orientation of graphs and hypergraphs
- Arc-disjoint in-trees in directed graphs
- Title not available (Why is that?)
- On maximal independent arborescence packing
- Matroid-Based Packing of Arborescences
- Covering intersecting bi-set families under matroid constraints
- Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
- Old and new results on packing arborescences in directed hypergraphs
- Edmonds' branching theorem in digraphs without forward-infinite paths
Cited In (10)
- Packing branchings under cardinality constraints on their root sets
- Old and new results on packing arborescences in directed hypergraphs
- Arborescence problems in directed graphs: theorems and algorithms
- On reachability mixed arborescence packing
- Packing of mixed hyperarborescences with flexible roots via matroid intersection
- Reachability in arborescence packings
- Packing of maximal independent mixed arborescences
- Packing of spanning mixed arborescences
- Matroid-rooted packing of arborescences
- Packing of arborescences with matroid constraints via matroid intersection
This page was built for publication: Old and new results on packing arborescences in directed hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744239)
