Old and new results on packing arborescences in directed hypergraphs

DOI10.1016/J.DAM.2017.11.004MaRDI QIDQ1744239zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

arborescencedirected hypergraphmatroidpacking

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

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

Cites work

• Arc-disjoint in-trees in directed graphs
• Connections in combinatorial optimization
• Covering intersecting bi-set families under matroid constraints
• Edmonds' branching theorem in digraphs without forward-infinite paths
• scientific article; zbMATH DE number 3799695 (Why is no real title available?)
• Matroid-Based Packing of Arborescences
• Old and new results on packing arborescences in directed hypergraphs
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On maximal independent arborescence packing
• On the orientation of graphs and hypergraphs
• Packing arborescences
• Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
• Variations for Lovász’ Submodular Ideas

Cited in

(18)

• Old and new results on packing arborescences in directed hypergraphs
• Packing of mixed hyperarborescences with flexible roots via matroid intersection
• Reachability in arborescence packings
• Packing of arborescences with matroid constraints via matroid intersection
• Packing of maximal independent mixed arborescences
• Packing branchings under cardinality constraints on their root sets
• On reachability mixed arborescence packing
• Arborescence problems in directed graphs: theorems and algorithms
• Packing of spanning mixed arborescences
• Matroid-rooted packing of arborescences
• Covering a supermodular-like function in a mixed hypergraph
• Approximate cut \& packing ratios for multi-commodity arborescences
• On arborescence packing augmentation in hypergraphs
• Matroid-reachability-based decomposition into arborescences
• Regular packing of rooted hyperforests with root constraints in hypergraphs
• Reconfiguration of the union of arborescences
• Reconfiguration of the union of arborescences
• Packing mixed hyperarborescences

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)