Deterministic -time algorithms for computing the -connected components in directed graphsResearch Paper
Edge connectivity measures how robust a network is against link failures. In a directed graph, two vertices are -edge-connected when pairwise edge-disjoint directed paths run from each to the other; this relation is an equivalence, and its classes, the -edge-connected components, describe which groups of vertices survive the deletion of any edges…