Edge splitting and connectivity augmentation in directed hypergraphs.
From MaRDI portal
Publication:1417568
DOI10.1016/S0012-365X(03)00229-2zbMath1034.05028OpenAlexW2061084515MaRDI QIDQ1417568
Alex R. Berg, Bill Jackson, Tibor Jordán
Publication date: 5 January 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00229-2
Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (3)
A Survey on Covering Supermodular Functions ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Sufficient conditions for maximally edge-connected hypergraphs
Cites Work
- Generalized polymatroids and submodular flows
- Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
- Structures of polyhedra determined by submodular functions on crossing families
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Detachments Preserving Local Edge-Connectivity of Graphs
- Highly edge-connected detachments of graphs and digraphs
- Detachment of Vertices of Graphs Preserving Edge-Connectivity
This page was built for publication: Edge splitting and connectivity augmentation in directed hypergraphs.
