Improving Computing Performance for Algorithm Finding Maximal Flows on Extended Mixed Networks
Year: 2015
Journal of Information and Computing Science, Vol. 10 (2015), Iss. 3 : pp. 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.
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2024-JICS-22540
Journal of Information and Computing Science, Vol. 10 (2015), Iss. 3 : pp. 163–168
Published online: 2015-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 6