Bipartition constrained edge-splitting in directed graphs

DOI10.1016/S0166-218X(01)00214-1zbMath0989.05051MaRDI QIDQ5954237

Tibor Jordán, Harold N. Gabow

Publication date: 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraphpolynomial algorithmbipartitionedge-connectivity augmentation problemsplitting off edges

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• Matroid theory and its applications in electric network theory and in statics
• Incrementing bipartite digraph edge-connectivity
• A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Edge-Connectivity Augmentation with Partition Constraints
• How to Make a Square Grid Framework with Cables Rigid

This page was built for publication: Bipartition constrained edge-splitting in directed graphs