A Maximum Positive Flow in a Complete Weighted Bidirectional Graphs

R Ganapathyraman
2014 Annals of Pure and Applied Mathematics   unpublished
In this paper we discuss a graph-theoretic definition of flow networks and define the maximum-flow problem. A flow network G=(V,E) is a bi-directional connected graph in which edge (u,v)∈E has a non-negative capacity c(u, v) ≥ 0.We consider the problem of identifying positive flow in a complete weighted bi-directional network where the flow nodes would result in variation of quantity in a given interval of time.