Advertisement
Published in:
2016 | OriginalPaper | Chapter
Sink Toward Source Algorithm Finding Maximal Flows on Extended Mixed Networks
Authors : Viet Tran Ngoc, Hung Hoang Bao, Chien Tran Quoc, Thanh Le Manh, Van Hoang Thi Khanh
Published in: Intelligent Information and Database Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 sink toward source algorithm finding maximal flows on extended mixed networks.