This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: a directed graph G = (V, E) with the following features Associated with each edge is a capacity, a nonnegative number, c e There is a single source node s ∈ V There is a single sink node t ∈ V Nodes other than s and t = internal nodes Assumptions No edge enters the source s and no edge leaves the sink t there is at least one edge incident to each node all capacities are integers 601 60 Defning Flow An st ±ow is a ²unction ² that maps each edge e to a nonnegative real number, ² : E > R + ; the value ²(e) intuitively represents the amount o² ±ow carried by an edge e A ±ow must satis²y the ²ollowing two properties: 602...
View
Full Document
 Spring '08
 KLEINBERG
 Algorithms, Graph Theory, Sort, Negative and nonnegative numbers, internal nodes Assumptions

Click to edit the document details