- Journal Home
- Volume 19 - 2024
- Volume 18 - 2023
- Volume 17 - 2022
- Volume 16 - 2021
- Volume 15 - 2020
- Volume 14 - 2019
- Volume 13 - 2018
- Volume 12 - 2017
- Volume 11 - 2016
- Volume 10 - 2015
- Volume 9 - 2014
- Volume 8 - 2013
- Volume 7 - 2012
- Volume 6 - 2011
- Volume 5 - 2010
- Volume 4 - 2009
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Improving Computing Performance for Algorithm Finding Maximal Flows on Extended Mixed Networks
J. Info. Comput. Sci. , 10 (2015), pp. 163-168.
[An open-access article; the PDF is free to any online user.]
Cited by
Export citation
- 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 = {2015},
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 = {3080-180X},
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 - 2015
DA - 2015/09
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. (2015). 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