TY - JOUR

T1 - Finding the edge connectivity of directed graphs

AU - Mansour, Yishay

AU - Schieber, Baruch

N1 - Funding Information:
*Supported by an ISEF fellowship and by NSF Contract CCR8611442.

PY - 1989/3

Y1 - 1989/3

N2 - 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 O(λ2n2) time, where λ is the edge connectivity of G. Combining both algorithms yields an O(MIN{m, λ2n}n) time algorithm for finding the edge connectivity of directed graphs. We also present an O(MIN{m, k2n}n) time algorithm for deciding whether the edge connectivity of a given directed graph G is at least k. Both algorithms are superior to the best known algorithms for finding the edge connectivity of directed graphs.

AB - 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 O(λ2n2) time, where λ is the edge connectivity of G. Combining both algorithms yields an O(MIN{m, λ2n}n) time algorithm for finding the edge connectivity of directed graphs. We also present an O(MIN{m, k2n}n) time algorithm for deciding whether the edge connectivity of a given directed graph G is at least k. Both algorithms are superior to the best known algorithms for finding the edge connectivity of directed graphs.

UR - http://www.scopus.com/inward/record.url?scp=38249024788&partnerID=8YFLogxK

U2 - 10.1016/0196-6774(89)90024-2

DO - 10.1016/0196-6774(89)90024-2

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38249024788

SN - 0196-6774

VL - 10

SP - 76

EP - 85

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 1

ER -