Increasing digraph arc-connectivity by arc addition, reversal and complement
From MaRDI portal
Publication:1613410
DOI10.1016/S0166-218X(01)00319-5zbMath1002.68120MaRDI QIDQ1613410
Esther M. Arkin, Refael Hassin, Shimon (Moni) Shahar
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- A dual ascent approach for steiner tree problems on a directed graph
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmentation Problems
- An Algorithm for Submodular Functions on Graphs
- Centroids, Representations, and Submodular Flows
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs