Increasing digraph arc-connectivity by arc addition, reversal and complement

DOI10.1016/S0166-218X(01)00319-5zbMath1002.68120OpenAlexW1997613377MaRDI QIDQ1613410

Refael Hassin, Esther M. Arkin, Shimon (Moni) Shahar

Publication date: 29 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00319-5

zbMATH Keywords

arc-connectivity of directed graphs

Mathematics Subject Classification ID

Connectivity (05C40) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

Making bidirected graphs strongly connected

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

This page was built for publication: Increasing digraph arc-connectivity by arc addition, reversal and complement