TY - JOUR
T1 - Improving Computing Performance for Algorithm Finding Maximal Flows on Extended Mixed Networks
AU - Viet Tran Ngoc, Chien Tran Quoc and Tau Nguyen Van
JO - Journal of Information and Computing Science
VL - 3
SP - 163
EP - 168
PY - 2024
DA - 2024/01
SN - 10
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22540.html
KW - extended, graph, network, flow, maximal flow, algorithm. 

AB - Graph is a powerful mathematical tool applied in many fields as transportation, communication, 
informatics, economy, … In ordinary graph the weights of edges and vertexes are considered independently 
where  the length of a path is  the  sum of   weights of the edges and the vertexes on this path. However, in 
many practical problems, weights at a vertex are not the same for all paths passing this vertex, but depend on 
coming and leaving edges. The paper develops a model of extended network that can be applied to modelling 
many practical problems more exactly and effectively. The main contribution of this paper is a source-sink 
alternative  algorithm,  then  improving  computing  performance  for  algorithm  finding  maximal  flows  on 
extended mixed networks.