Sequential Decomposition Algorithm of Blocking the Selected Edges in the Digraph

Abstract

is licensed under Creative Commons Attribution 4.0 License ABBA.MS.ID.000564. Abstract In this paper, a protein network represented by a directed graph is considered. The problem of determining the minimum number of edges that break paths from the input proteins of the network to the output ones and passing through some subset of proteins in this network is analyzing. A sequential decomposition algorithm, basing on a selection of classes of cyclically equivalent nodes in the sub-graphs with dedicated subset of nodes and on a construction of some bipartite graph is suggesting.