Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs
From MaRDI portal
Publication:2946426
DOI10.1007/978-3-662-48054-0_48zbMath1466.68064MaRDI QIDQ2946426
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
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
05C40: Connectivity
Related Items
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