Algorithm exceptions of the selected vertices in the digraph

G.Sh. Tsitsiashvili, V.P. Bulgakov, A.S. Losev
2019 Applied Mathematical Sciences  
In this paper we consider a protein network represented by a directed graph. 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 set of proteins in this network is analysed. This problem is solved by factorization of vertices of a directed graph with respect to cyclic equivalence.
doi:10.12988/ams.2019.9357 fatcat:jghawx5k2ngpzab465cq37htbe