1 Assignment #3 is posted: Due Thursday Nov. 15 at the beginning of class. Make sure you are also working on your projects. Come see me if you are unsure.

Slides:



Advertisements
Similar presentations
 Theorem 5.9: Let G be a simple graph with n vertices, where n>2. G has a Hamilton circuit if for any two vertices u and v of G that are not adjacent,
Advertisements

1 Matching Polytope x1 x2 x3 Lecture 12: Feb 22 x1 x2 x3.
Bipartite Matching, Extremal Problems, Matrix Tree Theorem.
10.4 Spanning Trees. Def Def: Let G be a simple graph. A spanning tree of G is a subgraph of G that is a tree containing every vertex of G See handout.
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
EMIS 8374 Vertex Connectivity Updated 20 March 2008.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 8 Network models.
Connectivity and Paths
CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that S has more than one component. Connectivity of G ((G)): The.
Lecture 12 Minimum Spanning Tree. Motivating Example: Point to Multipoint Communication Single source, Multiple Destinations Broadcast – All nodes in.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
Gomory-Hu Tree for representation of minimum cuts Elad Avni.
1 Submodular Functions in Combintorial Optimization Lecture 6: Jan 26 Lecture 8: Feb 1.
Chapter 4: Straight Line Drawing Ronald Kieft. Contents Introduction Algorithm 1: Shift Method Algorithm 2: Realizer Method Other parts of chapter 4 Questions?
Minimum Spanning Trees
The Shortest Path Problem
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
Introduction to Graph Theory
Minimal Spanning Trees What is a minimal spanning tree (MST) and how to find one.
Theory of Computing Lecture 10 MAS 714 Hartmut Klauck.
5.4 Shortest-path problem  Let G=(V,E,w) be a weighted connected simple graph, w is a function from edges set E to position real numbers set. We denoted.
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
Minimum Cost Flows. 2 The Minimum Cost Flow Problem u ij = capacity of arc (i,j). c ij = unit cost of shipping flow from node i to node j on (i,j). x.
Theory of Computing Lecture 13 MAS 714 Hartmut Klauck.
 2004 SDU Lecture 7- Minimum Spanning Tree-- Extension 1.Properties of Minimum Spanning Tree 2.Secondary Minimum Spanning Tree 3.Bottleneck.
 Rooted tree and binary tree  Theorem 5.19: A full binary tree with t leaves contains i=t-1 internal vertices.
5.5.3 Rooted tree and binary tree  Definition 25: A directed graph is a directed tree if the graph is a tree in the underlying undirected graph.  Definition.
Introduction to Graph Theory
Max Flow – Min Cut Problem. Directed Graph Applications Shortest Path Problem (Shortest path from one point to another) Max Flow problems (Maximum material.
Partitioning the Labeled Spanning Trees of an Arbitrary Graph into Isomorphism Classes Austin Mohr.
EMIS 8373: Integer Programming Combinatorial Relaxations and Duals Updated 8 February 2005.
Chapter 8 Maximum Flows: Additional Topics All-Pairs Minimum Value Cut Problem  Given an undirected network G, find minimum value cut for all.
Graph Theory. undirected graph node: a, b, c, d, e, f edge: (a, b), (a, c), (b, c), (b, e), (c, d), (c, f), (d, e), (d, f), (e, f) subgraph.
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
Exercise 6.1 Find the number of different shortest paths from point A to point B in a city with perfectly horizontal streets and vertical avenues as shown.
12. Lecture WS 2012/13Bioinformatics III1 V12 Menger’s theorem Borrowing terminology from operations research consider certain primal-dual pairs of optimization.
A directed graph G consists of a set V of vertices and a set E of arcs where each arc in E is associated with an ordered pair of vertices from V. V={0,
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Matchings and Factors Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
5.6 Prefix codes and optimal tree Definition 31: Codes with this property which the bit string for a letter never occurs as the first part of the bit string.
::Network Optimization:: Minimum Spanning Trees and Clustering Taufik Djatna, Dr.Eng. 1.
TU/e Algorithms (2IL15) – Lecture 8 1 MAXIMUM FLOW (part II)
Introduction to Algorithms
Minimum Spanning Tree 8/7/2018 4:26 AM
Graph theory Definitions Trees, cycles, directed graphs.
What is the next line of the proof?
COMP 6/4030 ALGORITHMS Prim’s Theorem 10/26/2000.
Lecture 12 Algorithm Analysis
Greedy Algorithms / Minimum Spanning Tree Yin Tat Lee
Chapter 5. Optimal Matchings
Autumn 2016 Lecture 11 Minimum Spanning Trees (Part II)
Connected Components Minimum Spanning Tree
Autumn 2015 Lecture 11 Minimum Spanning Trees (Part II)
3.5 Minimum Cuts in Undirected Graphs
Chapter 23 Minimum Spanning Tree
CS 583 Analysis of Algorithms
Autumn 2015 Lecture 10 Minimum Spanning Trees
R. Johnsonbaugh Discrete Mathematics 5th edition, 2001
Lecture 12 Algorithm Analysis
Richard Anderson Lecture 21 Network Flow
Problem Solving 4.
Algorithms (2IL15) – Lecture 7
Lecture 21 Network Flow, Part 1
Lecture 12 Algorithm Analysis
Winter 2019 Lecture 11 Minimum Spanning Trees (Part II)
Graph Theory: Cuts and Connectivity
Autumn 2019 Lecture 11 Minimum Spanning Trees (Part II)
Presentation transcript:

1 Assignment #3 is posted: Due Thursday Nov. 15 at the beginning of class. Make sure you are also working on your projects. Come see me if you are unsure about what to do next.

Weights on edges are 1. These two graphs have the same sized minimum cuts between every pair of vertices: 2

A bigger example: 3

Crossing Cuts Cuts (X, X’) and (Y, Y’) cross if all 4 of: X  Y X  Y’ X’  Y X’  Y’ are non-empty. 4

5

6

7

These 2 cuts cross 8

9

Simplifying the picture 10

11

12

13

14

15

16 X= P ⋃ Q, Y= P ⋃ R. Without loss of generality, s is in P. Assume u ∈ R and v ∈ S. The vertex t might be u or v.

17

18

19

Theorem [Triangle inequality for cutsets] Let f i,j be the maximum amount of flow possible from vertex i to vertex j. From our flow theory we know that this also equals the capacity of a minimum i,j-cut. Then f i,k  Min {f ij, f j,k } for all i, j, k., 20

f i,k  Min {f ij, f j,k } for all i, j, k., n 21 f j,k ≤ f i,k f i,j ≤ f i,k

Theorem [Triangle inequality for cutsets] Let f i,j be the maximum amount of flow possible from vertex i to vertex j. From our flow theory we know that this also equals the capacity of a minimum i,j-cut. Then f i,k  Min {f ij, f j,k } for all i, j, k., Corollary: f 1,k  Min { f 1,2, f 2,3, f 3,4, … f k-1, k } Proof by induction. 22

Theorem: A graph G has at most n-1 distinct flow values between pairs of vertices. Idea in proof: Start with a complete graph on n vertices with each edge (u,v) labelled with f uv. Choose a maximum weight spanning tree T of G. Any chord (w,v) of T must have f w,x equal to the minimum weight edge on the path connecting w to x. Gomory-Hu algorithm: Constructs T. 23

Recall: Any chord (w,v) of T must have f w,x equal to the minimum weight of an edge on the path connecting w to x. Furthermore, if (u,v) is a minimum weight edge on the path from w to x, then one minumum w,x-cut of G can be found by considering T- (u,v) and setting X= subset of vertices in same component as vertex w in T-(u,v), and X’= the rest of the vertices. 24

Gomory-Hu Cut Tree Algorithm At every step of the algorithm we have constructed some tree T. Each node of T corresponds to a subset of the vertices of G with each vertex of G in exactly one subset. I will call the vertices of T supernodes (each supernode corresponds to one or more vertices of the original graph). 25

Initially, T consists of one supernode which corresponds to the set of all vertices of G. At each step of the algorithm, a supernode containing two or more vertices from G is split into two supernodes which are connected by an edge. This means at each iteration, the tree gains one more edge and one more vertex. We stop when each supernode corresponds to exactly one vertex from G. 26

At each phase of the algorithm: 1.Let S be a supernode of T that corresponds two or more vertices in G. Choose two vertices s and t from S. Create G’ from G : for each component T’ of T – S, contract together the vertices of T’ in G. 2.Find a minimum s,t-cut (X, X’) in G’ which has capacity f s,t. 27

To update the tree T: 1. Delete vertex S (and the edges incident to S). 2. Add two supernodes x and x’ where x corresponds to the vertices of G from S which end up on the X side of the cut and x’ to the ones from S on the X’ side. Add edge (x,x’) with weight f s,t. 3. For edge (v, S) in the previous tree, vertex v was in a subtree T’ of T-S that was contracted to a single vertex v’. If v’ ends up on the X side of the cut, then add edge (v, x). Otherwise, add edge (v, x’). The new weight is the same as the weight of (v, S). 28

Example: 29