The Revised Ford-Fulkerson Algorithm Finding Maximal Flows On Extended Networks

Download Now
Provided by: Creative Commons
Topic: Networking
Format: PDF
Graph is a powerful mathematical tool applied in many fields as transportation, communication, informatics, economy, etc. 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 modelize many practical problems more exact and effective.
Download Now

Find By Topic