Flow Networks

Flow Networks
05 — 08 — 2009
Sören Wellhöfer
Introduction
Definitions
Problems / Solutions
References
Table of Contents
1 Introduction
2 Definitions
3 Problems / Solutions
4 References
Sören Wellhöfer Flow Networks

Introduction
Definitions
References
Flow network
Abstract
• Directed graph
• Source s and sink t

Introduction
Definitions
References
Flow network
a
Abstract
• Directed graph
• Source s and sink t s t
• Edges have capacity

Introduction
Definitions
References
Flow network
a
Abstract 1
5
• Directed graph
• Source s and sink t s 3 t
• Flow: s → t 2 5
b

Introduction
Definitions
References
Flow network
a
Abstract 1
5
• Directed graph
• Source s and sink t s 3 t
• Flow: s → t 2 5
b

Introduction
Definitions
References
Flow network
a
Abstract 1/1
3/5
• Directed graph
• Source s and sink t s 2/ 3 t
• Flow: s → t 2/2 4/ 5
• Flow from s b
equals flow into t

Introduction
Definitions
References
Flow network
a
Abstract 1/1
3/5
• Directed graph
• Source s and sink t s 2/ 3 t
• Flow: s → t 2/2 4/ 5
• Flow from s b
equals flow into t

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Formal definition
Nf = G (V , E )
V u, v ∈ V Set of vertices (nodes)

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Formal definition
Nf = G (V , E )

(u, v ) ∈ E Set of edges (arcs)

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Formal definition
Nf = G (V , E )

c(u, v ) Real-valued edge capacity

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Formal definition
Nf = G (V , E )

f (u, v ) Net-flow from u to v

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Formal definition
Nf = G (V , E )

s, t ∈ V Source and sink

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Formal definition
Nf = G (V , E )

s, t ∈ V Source and sink

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network Properties
Capacity constraints
0 ≤ f (u, v ) ≤ c(u, v )

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network Properties
0 ≤ f (u, v ) ≤ c(u, v )
Skew symmetry
f (u, v ) = −f (v , u)

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network Properties
0 ≤ f (u, v ) ≤ c(u, v )
Skew symmetry
f (u, v ) = −f (v , u)

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Properties
Flow conservation
P
u∈V f (u, w ) = 0,
if u 6= s ∧ u 6= t

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Properties
Flow conservation
P
u∈V f (u, w ) = 0,
if u 6= s ∧ u 6= t
Net flow to node = 0

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Properties
Flow conservation
P
u∈V f (u, w ) = 0,
if u 6= s ∧ u 6= t

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Properties
Flow conservation
P
u∈V f (u, w ) = 0,
if u 6= s ∧ u 6= t
3 1
n

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Properties
Flow conservation
P
u∈V f (u, w ) = 0,
if u 6= s ∧ u 6= t
3 -1
n
-2

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Properties
Flow conservation
P
u∈V f (u, w ) = 0,
if u 6= s ∧ u 6= t
3 -1
n
P -2
=0
Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Capacity of a Path
a
5 1
s 3 t
2 5
b
p = (s, a, b, t)

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Capacity of a Path
a
5 1
s 3 t
2 5
b
p = (s, a, b, t)
c(p) = min(c(s, a), c(a, b), c(b, t))

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Capacity of a Path
a
5 1
s 3 t
2 5
b
p = (s, a, b, t)
c(p) = min(c(s, a), c(a, b), c(b, t))

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Capacity of a Path
a
5 1
s 3 t
2 5
b
p = (s, a, b, t)
c(p) = min(c(s, a), c(a, b), c(b, t))
c(p) = min(5, 3, 5)

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Capacity of a Path
a
5 1
s 3 t
2 5
b
p = (s, a, b, t)
c(p) = min(c(s, a), c(a, b), c(b, t))
c(p) = min(5, 3, 5) = 3

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Capacity of a Path
a
5 1
s 3 t
2 5
b
p = (s, a, b, t)
c(p) = min(c(s, a), c(a, b), c(b, t))
c(p) = min(5, 3, 5) = 3

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
Nr = Gr (V , Er ) Er ... residual edges

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
cr (u, v ) = c(u, v ) − f (u, v )

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
cr (u, v ) = c(u, v ) − f (u, v ) ... residual edge capacity

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
a
3/5 1/1
s 2/3 t
2/2 4/5
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
a
3/5 1/1
-3
s 2/3 t
2/2 4/5
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
a
3/5 1/1
-3 -1
s 2/3 -2 t
-2 -4
2/2 4/5
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
a
2 0
3 1
s 1 3 t
2 4
0 1
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
a
2 0
Augmenting path:
3 1
pa = (s, a, b, t)
s 1 3 t
2 4
0 1
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
a
2 0
Augmenting path:
3 1
pa = (s, a, b, t)
s 1 3 t
2 4 cr (pa ) = min(2, 1, 1) = 1
0 1
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Residual Network
a
2 0
Augmenting path:
3 1
pa = (s, a, b, t)
s 1 3 t
2 4 cr (pa ) = min(2, 1, 1) = 1
0 1
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut
Partition of G into two sets S and T

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut
Partition of G into two sets S and T s ∈S ∧t ∈T

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut
a
5 1
s 3 t
2 5
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut
a
5 1
s 3 t
2 5
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut
a
5 1
s 3 t
S
2 5
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut
a
Cut Capacity:
5 1
P
c(S, T ) = u∈S∧v ∈T c(u, v )
s 3 t
S T =G −S
2 5
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut
a
Cut Capacity:
5 1
P
c(S, T ) = u∈S∧v ∈T c(u, v )
s 3 t
c(S, T ) = 5 + 5 = 10
S T =G −S
2 5
b

Formal definition
Introduction
Network Properties
Definitions
Path capacity
Residual network
References
Network cuts
Network cut
a
Cut Capacity:
5 1
P
c(S, T ) = u∈S∧v ∈T c(u, v )
s 3 t
c(S, T ) = 5 + 5 = 10
S T =G −S
2 5
b

Introduction
Definitions Maximum Flow
Problems / Solutions Ford-Fulkerson Algorithm
References
Maximum Flow
Flow at max if no augmenting paths in G

Introduction
References
Maximum Flow

Introduction
References
Maximum Flow
a
3/5 1/1
s 2/3 t
2/2 4/5
b

Introduction
References
Maximum Flow
a
2 0
3 1
s 1 3 t
2 4
0 1
b

Introduction
References
Maximum Flow
a
2 0
3 1
s 1 3 t
2 4
0 1
b

Introduction
References
Maximum Flow
a
1 0
3 1
s 0 3 t
2 4
0 0
b

Introduction
References
Maximum Flow
a
4/5 1/1
s 3/3 t
2/2 5/5
b

Introduction
References
Ford-Fulkerson Algorithm
• 1956, L. Ford and D. Fulkerson

Introduction
References

• Compute maximum flow of Nf in O(|E | · f )

Introduction
References

• Might not find max flow
• Termination not guaranteed

Introduction
References

Idea:
While there exist augmenting paths,
increase flow along those.

Introduction
References

Idea:
While there exist augmenting paths,
increase flow along those.

Introduction
References
Initialization

Introduction
References
Initialization
∀(u, v ) ∈ E

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
while ∃pa ∈ Gr

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
while ∃pa ∈ Gr (there exist augmenting paths)

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
· compute cr (pa )

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
· compute cr (pa )
· ∀(u, v ) ∈ pa

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
· compute cr (pa )
· ∀(u, v ) ∈ pa
f (u, v ) += cr (pa )

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
· compute cr (pa )
· ∀(u, v ) ∈ pa
f (u, v ) += cr (pa ) (forward arc)

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
· compute cr (pa )
· ∀(u, v ) ∈ pa
f (v , u) -= cr (pa )

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
· compute cr (pa )
· ∀(u, v ) ∈ pa
f (v , u) -= cr (pa ) (backward arc)

Introduction
References
Initialization
∀(u, v ) ∈ E → f (u, v ) = 0
Augmentation
· compute cr (pa )
· ∀(u, v ) ∈ pa
f (v , u) -= cr (pa ) (backward arc)

Introduction
References
Ford-Fulkerson Algorithm Demo
a
0/5 0/1
s 0/3 t
0/2 0/5
b
P P
f (s, t) = u∈V f (s, u) = u∈V f (u, t)
=0

Introduction
References
a
1/5 1/1
s 0/3 t
0/2 0/5
b
P P
f (s, t) = u∈V f (s, u) = u∈V f (u, t)
=1

Introduction
References
a
4/5 1/1
s 3/3 t
0/2 3/5
b
P P
f (s, t) = u∈V f (s, u) = u∈V f (u, t)
=4

Introduction
References
a
4/5 1/1
s 3/3 t
2/2 5/5
b
P P
f (s, t) = u∈V f (s, u) = u∈V f (u, t)
=6

Introduction
References

a
4/5 1/1
s 3/3 t
2/2 5/5
b
P P
f (s, t) = u∈V f (s, u) = u∈V f (u, t)
fmax (s, t) = 6

Introduction
References
Minimum-cut Maximum-flow theorem

• Minimum cut: cut of smallest capacity c(S, T ) = min

Introduction
References


Introduction
References

a
5 1
s 3 t
2 5
b

Introduction
References

a
5 1
s 3 t
2 5
b

Introduction
References

a
5 1
s 3 t
2 5
b
cmin (S, T ) = 5 + 1 = 6
Introduction
References

a
4/5 1/1
s 3/3 t
2/2 5/5
b
fmax (s, t) = cmin (S, T ) = 6

Introduction
References
Summary
• Directed graph, capacities, flow

• Residual network, network cuts

Introduction
References
Summary

• Maximum flow, Ford-Fulkerson algorithm,
Min-cut Max-flow theorem

Introduction
References
Summary

Practical applications
• Pipe networks

Introduction
References
Summary

• Pipe networks
• Traffic flow modeling

Introduction
References
Summary

• Pipe networks
• Commodity/Market flow

Introduction
References
Summary

• Pipe networks
• Commodity/Market flow

Graph Theory
Bondy, Murty
Graduate Texts in Mathematics, Springer, 2008
Graphs, Flows, and the Ford-Fulkerson Algorithm
Vince Vatter, 2004
Network flows
Kevin Weyn, 2005
A simple Min-cut algorithm
Mechthild Stoer, Frank Wagner
Freie Universität Berlin, 1997
Flow network, Ford-Fulkerson algorithm, Maximum-flow
minimum-cut theorem
Wikipedia, [http://en.wikipedia.org/wiki], 2009
Introduction
Definitions
References
Flow Networks
05 — 08 — 2009
Sören Wellhöfer

Flow Networks

Enviado por

Dados do documento

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Flow Networks

Enviado por

Direitos autorais:

Formatos disponíveis

Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

V u, v ∈ V Set of vertices (nodes)

Sören Wellhöfer Flow Networks

V u, v ∈ V Set of vertices (nodes)

Sören Wellhöfer Flow Networks

V u, v ∈ V Set of vertices (nodes)

Sören Wellhöfer Flow Networks

V u, v ∈ V Set of vertices (nodes)

Sören Wellhöfer Flow Networks

V u, v ∈ V Set of vertices (nodes)

Sören Wellhöfer Flow Networks

V u, v ∈ V Set of vertices (nodes)

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Net flow to node = 0

Sören Wellhöfer Flow Networks

Net flow to node = 0

Sören Wellhöfer Flow Networks

Net flow to node = 0

Sören Wellhöfer Flow Networks

Net flow to node = 0

Sören Wellhöfer Flow Networks

Net flow to node = 0

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Sören Wellhöfer Flow Networks

Flow at max if no augmenting paths in G

Sören Wellhöfer Flow Networks

Flow at max if no augmenting paths in G

Sören Wellhöfer Flow Networks

Flow at max if no augmenting paths in G