Open Access Conceptual Paper

Sequential Decomposition Algorithm of Blocking the Selected Edges in the Digraph

Tsitsiashvili Gurami*

Institute for Applied Mathematics FEB RAS, Russia

Corresponding Author

Received Date: October 28, 2019;  Published Date: November 04, 2019

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. This algorithm increases significantly previous results obtained in [1,2].

Keywords: Cluster; Digraph; Sub-graph; Protein network; Connectivity component

Citation
Signup for Newsletter
Scroll to Top