Extended network and algorithm finding maximal flows

International Journal of Electrical and Computer Engineering (IJECE)
Vol. 10, No. 2, April 2020, pp. 1632~1640
ISSN: 2088-8708, DOI: 10.11591/ijece.v10i2.pp1632-1640  1632
Journal homepage: http://ijece.iaescore.com/index.php/IJECE
Extended network and algorithm finding maximal flows
Tran Ngoc Viet1
, Le Hong Dung2
1
Faculty of Information Technology, Van Lang University, HCM City, Vietnam
2
Faculty of Information Technology, Central Transport College V, Danang City, Vietnam
Article Info ABSTRACT
Article history:
Received Apr 30, 2019
Revised Oct 8, 2019
Accepted Oct 17, 2019
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
algorithm finding maximal flows on extended networks.
Keywords:
Algorithm
Extended network
Flow
Graph
Maximal flow Copyright © 2020 Institute of Advanced Engineering and Science.
All rights reserved.
Corresponding Author:
Tran Ngoc Viet,
Faculty of Information Technology,
Van Lang University,
80/68 Duong Quang Ham Street,
Ward 5, Go Vap District, Ho Chi Minh City, Vietnam.
Email: tranngocviet@vanlanguni.edu.vn
1. INTRODUCTION
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 simply 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. Therefore, a more general type of weighted graphs, called extended weighted graph, is
defined in this work. The paper develops a model of extended network that can be applied to modelling many
practical problems more exactly and effectively. Based on the results of the study of the problem regarding
finding the maximum flow [1, 4, 6-8, 10-18, 20-21, 23-24] and extended graphs [2-3, 5, 9, 19, 22, 25-26] the
main contribution of this paper is the revised Ford-Fulkerson algorithm finding maximal flows on extended
networks.
2. EXTENDED NETWORK
A network is graph of the traffic G = (V, E), circles V and roads E. Roads can be classified as either
direction or non-direction. There are many sorts of means of transportation on the network. The non-direction
shows two-way roads while the direction shows one-way roads. Given a group of the functions on the network
as follows:
The function of the route circulation possibility 𝑐 𝐸: 𝐸  𝑅∗
, 𝑐 𝐸(𝑒) the route circulation possibility 𝑒 𝐸.
The function of the circle circulation possibility 𝑐 𝑉: 𝑉  𝑅∗
, 𝑐 𝑉(𝑢)the circle circulation possibility 𝑢 𝑉.
𝐺 = (𝑉, 𝐸, 𝑐 𝐸, 𝑐 𝑉): extended network (1)

Int J Elec & Comp Eng ISSN: 2088-8708 
Extended network and algorithm finding maximal flows (Tran Ngoc Viet)
1633
3. FLOW OF THE EXTENDED NETWORK
Given an extended network 𝐺 = (𝑉, 𝐸, 𝑐 𝐸, 𝑐 𝑉)a source point s and a sink point t.
Set { 𝑓(𝑥, 𝑦) | (𝑥, 𝑦) 𝐸 } is called the flow of network G if the requirements are met:
a. 0  𝑓(𝑥, 𝑦)  𝑐 𝐸(𝑥, 𝑦) (𝑥, 𝑦)𝐸
b. Any value of point r is referring to neither a sourse point nor a sink point
 


Erv
rvf
),(
,  
Evr
vrf
),(
,
(2)
c. Any value of point r is referring to neither a sourse point nor a sink point
 
Erv
rvf
),(
, 𝑐 𝑉(𝑟) (3)
Expression:  


Eva
vafFv
),(
,)( , is called the value of flow F (4)
3.1. The maximum problem
Given an extended network 𝐺 = (𝑉, 𝐸, 𝑐 𝐸, 𝑐 𝑉), a source point s and a sink point t. The task required
by the problem is finding the flow which has a maximum value. The flow value is limited by the total amount
of the circulation possibility on the roads starting from source points. As a result of this, there could be a
confirmation on the following theorem.
3.2. Theorem 1
Given an extended network 𝐺 = (𝑉, 𝐸, 𝑐 𝐸, 𝑐 𝑉), a source point s and a sink point t, then exist is the
maximal flow [1].
4. THE ALGORITHM FINDING MAXIMAL FLOWS
4.1. Source toward sink algorithm
Input: Given an extended network 𝐺 = (𝑉, 𝐸, 𝑐 𝐸, 𝑐 𝑉), a source point s and a sink point t. The points
in graph G are arranged in a certain order [3].
Output: Maximal flow 𝐹 = {𝑓(𝑥, 𝑦) | (𝑥, 𝑦)𝐸}.
(1) Start:
The departure flow: 𝑓(𝑥, 𝑦) ≔ 0, ∀(𝑥, 𝑦) ∈ 𝐸.
Points from the source points will gradually be labelled L1 for the first time including 5 components:
Form forward label
𝐿1(𝑣) = [, 𝑝𝑟𝑒𝑣1(𝑣), 𝑐1(𝑣), 𝑑1(𝑣), 𝑏𝑖𝑡1(𝑣)] and can be labelled () for the second time
𝐿2(𝑣) = [, 𝑝𝑟𝑒𝑣2(𝑣), 𝑐2(𝑣), 𝑑2(𝑣), 𝑏𝑖𝑡2(𝑣)].
Put labeling () for source point
L1(s) = [, , , , 1]
The set S comprises the points which have already been labelled () but are not used to label (), S’ is the point
set labelled () based on the points of the set S.
Begin
𝑆 ≔ {𝑠}, 𝑆′
≔ ∅
(2) Forward label generate:
(2.1) Choose forward label point:
𝐶𝑎𝑠𝑒 𝑆  ∅: Choose the point 𝑢 𝑆 of a minimum value. Remove the u from the set S,
𝑆: = 𝑆 {𝑢}. Assuming that the forward label of u is [, 𝑝𝑟𝑒𝑣𝑖(𝑢), 𝑐𝑖(𝑠), 𝑑𝑖(𝑠), 𝑏𝑖𝑡𝑖(𝑠)], 𝑖 = 1 𝑜𝑟 2.
A is the set of the points which are not forward label time and adjacent to the forward label point u.
Step (2.2).

 ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 10, No. 2, April 2020 : 1632 - 1640
1634
𝐶𝑎𝑠𝑒 𝑆 = ∅ 𝑎𝑛𝑑 𝑆’  ∅: 𝐴𝑠𝑠𝑖𝑔𝑛 𝑆 ≔ 𝑆’, 𝑆’: = ∅. Return to step (2.1).
𝐶𝑎𝑠𝑒 𝑆 = ∅ 𝑎𝑛𝑑 𝑆’ = ∅: The flow F is the maximum. End.
(2.2.) Forward label the points which are not forward label and are adjacent to the forward label points
Case = ∅ : Return to Step (2.1).
Case  ∅ : Choose 𝑣 𝐴 of a minimum value. Remove the v from the set 𝐴, 𝐴 ∶= 𝐴 {𝑣}.
Assign forward labeled point v:
If 1)(),,(),(,),(  ubitvucvufEvu iE put forward label point v:
𝑝𝑟𝑒𝑣𝑗(𝑣) ∶= 𝑢;
𝑐𝑗(𝑣): = 𝑚𝑖𝑛{𝑐𝑖(𝑢), 𝑐 𝐸(𝑢, 𝑣)𝑓(𝑢, 𝑣)}, 𝑖𝑓 𝑑𝑖(𝑢) = 0,
𝑐𝑗(𝑣): = 𝑚𝑖𝑛{𝑐𝑖(𝑢), 𝑐 𝐸(𝑢, 𝑣)𝑓(𝑢, 𝑣), 𝑑𝑖(𝑢)}, 𝑖𝑓 𝑑𝑖(𝑢) > 0;
𝑑𝑗(𝑣) ∶= 𝑐 𝑉(𝑣)  
Evi
vif
),(
, ;
𝑏𝑖𝑡𝑗(𝑣): = 1, 𝑖𝑓 𝑑𝑗(𝑣) > 0,
𝑏𝑖𝑡𝑗(𝑣): = 0, 𝑖𝑓 𝑑𝑗(𝑣) = 0.
If ,),( Euv  𝑓(𝑣, 𝑢) > 0, put forward label point v:
𝑝𝑟𝑒𝑣𝑗(𝑣) ∶= 𝑢;
𝑐𝑗(𝑣): = 𝑚𝑖𝑛{𝑐𝑖(𝑢), 𝑓(𝑣, 𝑢)},
𝑑𝑗(𝑣) ∶= 𝑐 𝑉(𝑣)   
Evi
vif
),(
, ; 𝑏𝑖𝑡𝑗(𝑣):= 1.
If v is not forward label, then return to Step (2.2).
If v is forward label and v is backward label, then making adjustments in increase of the flow.
Step (2.3).
If v is forward label and v is not backward label, then add v to S’,
𝑆’ ∶= 𝑆’  {𝑣}, and return to Step (2.2).
(3) Making adjustments in increase of the flow:
Suppose s is forward label [, 𝑝𝑟𝑒𝑣𝑖(𝑠), 𝑐𝑖(𝑠), 𝑑𝑖(𝑠), 𝑏𝑖𝑡𝑖(𝑠)]:
(3.1) Adjustment made from v back to s according to forward label
(3.1.1) Start
𝑦 ∶= 𝑣, 𝑥 ∶= 𝑝𝑟𝑒𝑣1(𝑣),  ∶= 𝑐1(𝑣).
(3.1.2.) Making adjustments
(i) Case (𝑥, 𝑦) the road section whose direction runs from x to y:
put 𝑓(𝑥, 𝑦) ∶= 𝑓(𝑥, 𝑦) + ..
(ii) Case (𝑥, 𝑦) the road section whose direction runs from y to x:
put 𝑓(𝑦, 𝑥) ∶= 𝑓(𝑦, 𝑥) ..
(iii) Case (𝑥, 𝑦) non-direction roads:
If 𝑓(𝑥, 𝑦)  0 𝑎𝑛𝑑 𝑓(𝑦, 𝑥) = 0, then
put f(x,y) := f(x,y) + .
If 𝑓(𝑦, 𝑥) > 0, then
put 𝑓(𝑦, 𝑥) ∶= 𝑓(𝑦, 𝑥) .
(3.1.3) Moving
(i) Case 𝑥 = 𝑠.. Step (3.2).
(ii) 𝑥  𝑠, 𝑝𝑢𝑡 𝑥 ∶= 𝑦 𝑎𝑛𝑑 𝑦: = 𝑘, 𝑘 is the second component of the forward labeled point x. Then
return to Step (3.1.2).
(3.2.) Remove all the labels of the network points, except for the source point s. Return to Step (2).

1635
4.2. Sink toward source algorithm
Input: Given an extended network 𝐺 = (𝑉, 𝐸, 𝑐 𝐸, 𝑐 𝑉), a source point s and a sink point t. The points in
graph G are arranged in a certain order [3].
Output: Maximal flow 𝐹 = {𝑓(𝑥, 𝑦) | (𝑥, 𝑦)𝐸}.
(1) Start:
The departure flow: 𝑓(𝑥, 𝑦):= 0, (𝑥, 𝑦)𝐸.
Points from the sink points will gradually be labelled L1 for the first time including 5 components:
Form backward label
L1(v) = [, prev1(v), c1(v), d1(v), bit1(v)] and can be label )( for the second time
L2(v) = (v) = [, prev2(v), c2(v), d2(v), bit2(v)].
Put labeling )( for sink point:
,1],,,[(t)L1   the set Tcomprises the points which have already been labelled )( but
are not used to label )( , T’ is the point set labelled )( based on the points of the set T. Begin
(2) Backward label generate:
(2.1) Choose backward label point:
Case T : Choose the point 𝑣  𝑇 of a minimum value. Remove the v from the set T,
𝑇: = 𝑇 {𝑣}. Assuming that the backward label of v is
[, 𝑝𝑟𝑒𝑣𝑖(𝑣), 𝑐𝑖(𝑡), 𝑑𝑖(𝑡), 𝑏𝑖𝑡𝑖(𝑡)], 𝑖 = 1 𝑜𝑟 2.
B is the set of the points which are not backward label time and adjacent to the backward label point v.
Step (2.2).
𝐶𝑎𝑠𝑒 T 𝑎𝑛𝑑 'T : 𝐴𝑠𝑠𝑖𝑔𝑛  :',': TTT . Return to step (2.1).
𝐶𝑎𝑠𝑒 𝑇 = ∅ 𝑎𝑛𝑑 𝑇′
= ∅: The flow F is the maximum. End.
(2.2) Backward label the points which are not backward label and are adjacent to the backward label points v
Case B : Return to Step (2.1).
Case B : Choose 𝑡  𝐵 of a minimum value. Remove the t from the set B, tBB : .
Assign backward labeled point t:
If 1)(),,(),(,),(  vbitvtcvtfEvt iE put backward label point t:
prev_j (t)∶= v;
𝑝𝑟𝑒𝑣𝑗(𝑡) ∶= 𝑣;
𝑐𝑗(𝑡): = 𝑚𝑖𝑛{𝑐𝑖(𝑣), 𝑐 𝐸(𝑡, 𝑣)  𝑓(𝑡, 𝑣)}, 𝑖𝑓 𝑑𝑖(𝑣) = 0,
𝑐𝑗(𝑡): = 𝑚𝑖𝑛{𝑐𝑖(𝑣), 𝑐 𝐸(𝑡, 𝑣)  𝑓(𝑡, 𝑣), 𝑑𝑖(𝑣)}, 𝑖𝑓 𝑑𝑖(𝑣) > 0;
𝑑𝑗(𝑡) ≔ 𝑐 𝑉(𝑡) − ∑ 𝑓(𝑖, 𝑡)
(𝑖,𝑡)∈𝐸
.
𝑏𝑖𝑡𝑗(𝑡): = 1, 𝑖𝑓 𝑑𝑗(𝑡) > 0,
𝑏𝑖𝑡𝑗(𝑡): = 0, 𝑖𝑓 𝑑𝑗(𝑡) = 0.
If 0),(,),(  tvfEtv , put backward label point t:
𝑝𝑟𝑒𝑣𝑗(𝑡) ∶= 𝑣;
𝑐𝑗(𝑡): = 𝑚𝑖𝑛{𝑐𝑖(𝑣), 𝑓(𝑣, 𝑡)},
𝑑𝑗(𝑡) ≔ 𝑐 𝑉(𝑡) − ∑ 𝑓(𝑖, 𝑡)
(𝑖,𝑡)∈𝐸
; 𝑏𝑖𝑡𝑗(𝑡) ≔ 1.
If t is not backward label, then return to Step (2.2).

 ISSN: 2088-8708
1636
If t is backward label and t is forward label, then making adjustments in increase of the flow.
Step (3).
If t is backward label and t is not forward label, then add t to T’,
T’:= T’ {t}, and return to Step (2.2).
(3) Making adjustments in increase of the flow:
Suppose t is backward label [, 𝑝𝑟𝑒𝑣𝑖(𝑡), 𝑐𝑖(𝑡), 𝑑𝑖(𝑡), 𝑏𝑖𝑡𝑖(𝑡)]
(3.1) Adjustment made from v to t according to backward label
(3.1.1) Start
𝑥 ∶= 𝑣, 𝑦 ∶= 𝑝𝑟𝑒𝑐1(𝑣),  ∶= 𝑐1(𝑣).
(3.1.2) Making adjustments
(i) Case (𝑥, 𝑦) the road section whose direction runs from x to y:
put 𝑓(𝑥, 𝑦) ∶= 𝑓(𝑥, 𝑦) + .
(ii) Case (𝑦, 𝑥) the road section whose direction runs from y to x:
put 𝑓(𝑦, 𝑥): = 𝑓(𝑦, 𝑥) .
(iii) Case (𝑥, 𝑦) non-direction roads:
If 𝑓(𝑥, 𝑦) 0 𝑎𝑛𝑑 𝑓(𝑦, 𝑥) = 0 then
put 𝑓(𝑥, 𝑦) ∶= 𝑓(𝑥, 𝑦) + .
If 𝑓(𝑦, 𝑥) > 0 then
put 𝑓(𝑦, 𝑥) ∶= 𝑓(𝑦, 𝑥) .
(3.1.3) Moving
(i) Case 𝑥 = 𝑡. Step (3.2).
(ii) Case 𝑥  𝑡, 𝑝𝑢𝑡 𝑥 ∶= 𝑦 𝑎𝑛𝑑 𝑦: = 𝑘, 𝑘 is the second component of the backward labeled point x.
Then return to step (3.1.2).
(3.2) Remove all the labels of the network points, except for the sink point t. Return to Step (2).
4.3. Theorem 2
If the value of the route circulation possibility and the circle circulation possibility are integers, then
after a limited number of steps, the processing of the maximum network problem will end.
Proof
According to theorem 1, after each time of making adjustment of the flow, the flow will be increased
with certain units (due to cE is a whole number, cV is a whole number, and δ is, therefore, a positive whole
number). On the other hand, the value of the flow is limited above by the total amount of the circulation
possibility at roads leaving the source points. So, after a limited number of steps, the processing of the
maximum network problem will end.
4.4. Theorem 3
Given an 𝐹 = {𝑓(𝑥, 𝑦) | (𝑥, 𝑦) 𝐸} is the flow on extended network G, a source point s and a sink
point t:
    

EtxExs
txfxsf
),(),(
,, (5)
Proof
The points of the set V. If x, y is not previous, assign 0),( yxf
   

Vy VxVy Vx
xyfyxf ),(),(
0),(),( 





     Vy Vx Vx
xyfyxf
        

EtxExsEtxExs
txfxsftxfxsf
),(),(),(),(
,,0,,
.

1637
4.5. The complexity of the algorithm
It is assumed that the road circulation possibilityand the point circulation possibilityare whole integer.
After each round step, to find the roads to increase the amount of circulation on the flow, we have to approve
to pass Eroads in maximum, and in order to adjust the flow we have to approve to pass 2. V roads, in
maximum.
As a result, the complexity of each time of increasing the flow is O(E  + 2. V).
Mark v* is the value of the maximum flow. So the complexity of the algorithm is
O(𝑣∗
(E  + 2. V)) (6)
5. RESULT OF THE EXPERIMENT
5.1. Example 1
Given an extended network graph Figure 1. The network has six circles, six direction roads and three
non-direction roads. The road circulation possibility cE and the circle circulation possibility cV. The source
point is l, the sink point is 6.
Figure 1. Extended network
Result of the first forward label:
Source point is 1: forward label [, , , , 1]
Point 2: forward label [, 1, 10, 10, 1]
Point 6: forward label [, 4, 7, , 1]
Result of the flow increasing adjustment in Figure 2 and the value of the increase v(F) = 7.
Figure 2. The value of the increase v(F) = 7

 ISSN: 2088-8708
1638
Result of the second forward label:
Point 4:
Result of third forward label:
Point 3: forward label [, 1, 2, 2, 1], [, 2, 2, 2, 1]
Point 4:
This is the maximum flow, because in the following forward label is not labelled – Sink point is 6.

1639
5.2. Example 2
Result of the first backward label:
Sink point is 6: backward label ]1,,,,[  
Point 5: backward label ]1,9,9,6,[
Point 1: backward label ]1,,7,3,[ 
Result of the flow increasing adjustment and the value of the increase v(F) = 7
Result of the second backward label:
Result of third backward label:
This is the maximum flow, because in the following backward label is not labelled-Source point is 1.
6. CONCLUSION
The article regarding building a model of an extended network so that the stylization of practical
problems can be applied more accurately and effectively. Next, source toward sink and sink toward source
algorithm finding maximal flows are being built. Finally, a concrete example is presented to illustrate source
toward sink and sink toward source algorithm.
ACKNOWLEDGEMENTS
The author would like to thank the Ministry of Technology - Higher Education and President, Van
Lang University for financial support to this research.
REFERENCES
[1] Tran Quoc Chien, “Weighted Source-Sink Alternative Algorithm to Find Maximal Flow,” The University of Danang-
Vietnam Journal of Science and Technology, vol. 3, no. 26, pp. 99-105, 2008.
[2] Tran Ngoc Viet; Tran Quoc Chien; and Le Manh Thanh, “The Revised Ford-Fulkerson Algorithm Finding Maximal
Flows on Extended Networks,” International Journal of Computer Technology and Applications,
vol. 5, no. 4, pp. 1438-1442, 2014.
[3] Viet Tran Ngoc; Chien Tran Quoc; and Tau Nguyen Van, “Improving Computing Performance for Algorithm Finding
Maximal Flows on Extended Mixed Networks,” Journal of Information and Computing Science, England, UK, vol.
10, no. 1, pp. 075-080, 2015.
[4] Goldberg A. V; and Tarjan R. E, “A new approach to the maximum ﬂow problem,” Journal of the ACM (JACM),
New York, NY, USA, vol. 35, no. 4, pp. 921-940, 1988.

 ISSN: 2088-8708
1640
[5] Tran Quoc Chien; Nguyen Mau Tue; and Tran Ngoc Viet, “Shortest Path Algorithm on Extended Graphs,”
Proceeding of the 6th National Conference on Fundamental and Applied Information Technology Research (FAIR),
Vietnam, pp. 522-527, 2013.
[6] Ellis L. Johnson, George L. Nemhauser; Joel S. Sokol, and Pamela H. Vance, “Shortest Paths and Multicommodity
Network Flows,” A Thesis Presented to the Academic Faculty, pp. 41-73, 2003.
[7] Anderson R. J; and Jo A. C. S, “On the Parallel Implementation of Goldberg’s Maximum Flow Algorithm,”
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, New York, USA: ACM,
pp. 168-177, 1992.
[8] Xiaolong Ma and Jie Zhou, “An extended shorted path problem with switch cost between arcs,” Proceedings of the
international multiconference of engineers and computer scientists, Hong Kong, IMECS, 2008.
[9] Xiangming Yao, Baomin Han, Baomin Han, Hui Ren, “Simulation-Based Dynamic Passenger Flow Assignment
Modelling for a Schedule-Based Transit Network;” Discrete Dynamics in Nature and Society- Hindawi, 2017.
[10] Michiel C.J. Bliemer, Mark P.H. Raadsen, “Static traffic assignment with residual queues and spillback, University
of Sydney,” ETH Zurich Conference paper STRC, 2017.
[11] P. T. Sokkalingam, R. K. Ahuja and J. B. Orlin, “New Polynomial-Time Cycle- Canceling Algorithms For Minimum-
Cost Flows,” Networks, pp. 1-21, 1996.
[12] L. K. Fleischer, “Approximating fractional multicommodity flow independent of the number of commodities,” SIAM
J. Discrete Math., vol.13, no.4, 2000.
[13] G. Karakostas, “Faster approximation schemes for fractional multicommodity flow problems,” In Proceedings, ACM-
SIAM Symposium on Discrete Algorithms, vol.4, no.1, 2002.
[14] Joseph Prashker and Shlomo Bekhor, “Some observations on stochastic user equilibrium and system optimum of
traffic assignment,” Transportation Research Part B: Methodological, vol. 34, no. 4, 2000.
[15] Luca Trevisan, “Generalizations of the Maximum Flow Problem,” Stanford University-CS261: Optimization, 2011.
[16] Wardrop, J. G, “Some Theoretical Aspects of Road Traffic Research,” Proceedings of the Institute of Civil Engineers,
Part II, 1952.
[17] Aleksander, “Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph
Algorithms,” Massachusetts Institute of Technology, 2009.
[18] Juan Carlos Munoz, Jorge A. Laval, “System optimum dynamic traffic assignment graphical solution method for a
congested freeway and one destination,” Transportation Research, Part B 40, 2006.
[19] Olaf Jahn, Rolf H. Möhring, “System Optimal Routing of Traffic Flows with User Constraints in Networks with
Congestion,” Vol. 53, No. 4, 2005.
[20] Erera, A.L., Daganzo, C.F., Lovell, “The access control problem on capacitated FIFO networks with unique O-D
paths is hard,” Operations Research, vol. 50, no. 4, 2002.
[21] Laval, J.A., Munõz, J.C, “System Optimum Diversion of Congested Freeway Traffic,” Institute of Transportation
Studies Research Report UCB-ITS-RR, 2002.
[22] Ziliaskopoulos, A.K, “A linear rogramming model for the single destination system optimum dynamic traffic
assignment problem,” Transportation Science, vol. 34, no.1, 2000.
[23] Mehlhorn, K., M. Ziegelmann, “Resource constrained shortest paths,” M. Paterson, ed. Proc. 8th Annual Eur.
Sympos. on Algorithms (ESA). Lecture Notes in Computer Science, Springer, Heidelberg, Germany, 2000.
[24] Merchant, D. K., G. L. Nemhauser, “A model and an algorithm for the dynamic traffic assignment problems,”
Transportation Sci. 12, 1978.
[25] Nagarney A, “Mathematical Models of Transportation and Networks,” Mathematical Models in Economics, 2007.
[26] Schulz, A. S., N. E. Stier-Moses, “On the performance of user equilibria in traffic networks,” Proc. 14th Annual
ACM-SIAM Sympos on Discrete Algorithms (SODA). SIAM, Philadelphia, PA, 2003.
BIOGRAPHIES OF AUTHORS
Dr. Tran Ngoc Viet. Born in 1973 in Thanh Khe District, Da Nang City, Vietnam. He graduated from
Maths_IT faculty of Da Nang university of science. He got master of science at university of Danang
and hold Ph.D Degree in 2017 at Danang university of technology. His main major: Applicable
mathematics in transport, parallel and distributed process, discrete mathemetics, graph theory, grid
Computing and distributed programming
Le Hong Dung was born in 1977. He graduated from information technology faculty of Da Lat
university. He got master of Danang university. Since 2018, he has been a PhD candidate at university
of Danang, Vietnam. His main major: discrete mathemetics, graph theory and distributed
programming.

Extended network and algorithm finding maximal flows

More Related Content

What's hot (20)

Similar to Extended network and algorithm finding maximal flows (20)

More from IJECEIAES (20)

Recently uploaded (20)

Extended network and algorithm finding maximal flows