Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
Sink Toward Source Algorithm Finding Maximal Flows on Extended Mixed Networks
verfasst von : Viet Tran Ngoc, Hung Hoang Bao, Chien Tran Quoc, Thanh Le Manh, Van Hoang Thi Khanh
Erschienen in: Intelligent Information and Database Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.