This preview shows pages 1–2. Sign up to view the full content.
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 satisy the ollowing two properties: 602...
View
Full
Document
This note was uploaded on 10/02/2008 for the course CS 482 taught by Professor Kleinberg during the Spring '08 term at Cornell University (Engineering School).
 Spring '08
 KLEINBERG
 Algorithms, Sort

Click to edit the document details