Highly Influenced

@article{Mansour1989FindingTE, title={Finding the Edge Connectivity of Directed Graphs}, author={Yishay Mansour and Baruch Schieber}, journal={J. Algorithms}, year={1989}, volume={10}, pages={76-85} }

- Published 1989 in J. Algorithms
DOI:10.1016/0196-6774(89)90024-2

We present two algorithms for finding the edge connectivity of a given directed graph G. The first algorithm runs in O( nm) time, where n is the number of vertices and m is the number of edges in G. The second algorithm runs in 0(Azn2) time, where A is the edge connectivity of G. Combining both algorithms yields an O(MIN( m, A2n}n) time algorithm for finding the edge connectivity of directed graphs. We also present an O(MIN( m, k*n ) n) time algorithm for deciding whether the edge connectivity… CONTINUE READING

### Presentations referencing similar topics