Edge splitting and connectivity augmentation in directed hypergraphs.

DOI10.1016/S0012-365X(03)00229-2MaRDI QIDQ1417568zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

connectivity augmentationdirected graphs and hypergraphsedge splittingedge-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 5535213
• Edge-connectivity augmentations of~graphs~and~hypergraphs
• scientific article; zbMATH DE number 1187145
• Edge-augmentation of hypergraphs
• Connectivity in directed hypergraphs
• A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Edge-connectivity in hypergraphs
• Augmenting and preserving partition connectivity of a hypergraph

Cites work

• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Detachment of Vertices of Graphs Preserving Edge-Connectivity
• Detachments Preserving Local Edge-Connectivity of Graphs
• Generalized polymatroids and submodular flows
• Highly edge-connected detachments of graphs and digraphs
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Structures of polyhedra determined by submodular functions on crossing families

Cited in

(4)

• Sufficient conditions for maximally edge-connected hypergraphs
• A Survey on Covering Supermodular Functions
• scientific article; zbMATH DE number 5535213 (Why is no real title available?)
• Directed hypergraphs: introduction and fundamental algorithms -- a survey

This page was built for publication: Edge splitting and connectivity augmentation in directed hypergraphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1417568)