arrow
Volume 10, Issue 3
Improving Computing Performance for Algorithm Finding Maximal Flows on Extended Mixed Networks

Viet Tran Ngoc, Chien Tran Quoc and Tau Nguyen Van

J. Info. Comput. Sci. , 10 (2015), pp. 163-168.

Export citation
  • Abstract
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.
  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JICS-10-163, author = {Viet Tran Ngoc, Chien Tran Quoc and Tau Nguyen Van}, title = {Improving Computing Performance for Algorithm Finding Maximal Flows on Extended Mixed Networks}, journal = {Journal of Information and Computing Science}, year = {2024}, volume = {10}, number = {3}, pages = {163--168}, abstract = {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. }, issn = {1746-7659}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22540.html} }
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.
Viet Tran Ngoc, Chien Tran Quoc and Tau Nguyen Van. (2024). Improving Computing Performance for Algorithm Finding Maximal Flows on Extended Mixed Networks. Journal of Information and Computing Science. 10 (3). 163-168. doi:
Copy to clipboard
The citation has been copied to your clipboard