LecX1 - COT 6936: Topics in Algorithms Giri Narasimhan ECS...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 COT 6936: Topics in Algorithms Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu http://www.cs.fiu.edu/~giri/teach/COT6936_S10.html https://online.cis.fiu.edu/portal/course/view.php?id=427 1 2/4/10 COT 6936 Network Flow: Example 2/4/10 COT 6936 2 Source Sink Capacity Network Flow: Example of a f ow 2/4/10 COT 6936 3 Flow value along edge Capacity of edge Total Flow in Network = 11 + 8 = 19
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Network Flow • Directed graph G(V,E) with capacity function on edges given by non-negative function c: E(G) ± R + . – Capacity of each edge, e, is given by c(e) – Source vertex s – Sink vertex t • Flow function f is a non-negative function of the edges – f: E(G) ± R + – Capacity constraints : f(e) ± c(e) – Flow conservation constraints : For all vertices except source and sink, sum of flow values along edges entering a vertex equals sum of flow values along edges leaving that vertex Flow value : sum of flow values from source vertex (or sum of flow into sink vertex)
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/18/2012 for the course CIS 6936 taught by Professor Giri during the Spring '12 term at FIU.

Page1 / 6

LecX1 - COT 6936: Topics in Algorithms Giri Narasimhan ECS...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online