Short Communications
Optimal Blocking of Undesired Nodes in Digraph
Received Date: April 14, 2020; Published Date: May 18, 2020
Abstract
This paper provides a complete solution to the problem of minimizing the number of edges in the protein network, the removal of which blocks all paths that pass through a set of undesirable nodes. The minimization problem is reduced to the problem of minimum cut and maximum flow in a specially constructed weighted digraph with a source and a drain.
Keywords: Digraph;Ford-Fulkerson Theorem;Sub-graph; Optimal Blocking.
-
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Signup for Newsletter
