Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs

DOI10.1007/978-3-662-48054-0_48zbMath1466.68064OpenAlexW2290374182MaRDI QIDQ2946426

Chenzi Zhang, Xiaowei Wu

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48054-0_48

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Bottlenecks and Edge Connectivity in Unsymmetrical Networks
• Very Simple Methods for All Pairs Network Flow Analysis
• An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
• Multi-Terminal Network Flows
• Network Flow and Testing Graph Connectivity
• Counterexamples for Directed and Node Capacitated Cut-Trees
• 2-Edge Connectivity in Directed Graphs
• Graph Connectivities, Network Coding, and Expander Graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs