Decomposition Algorithms of Blocking the Selected Edges in the Digraph

Abstract

Take all nodes from the subset / U and all edges between them. These nodes and edges create directed sub-graph / G G ⊆ . Replace all (directed) edges of the sub-graph / G by undirected ones and obtain undirected graph / / G . Define in the sub-graph / / G all its connectivity components / / / / 1,..., . n G G Return directions to all edges of the subgraph / k G and define in such a way the sub-graph k G of the digraph , 1,..., . G k n =