Graph Algorithms Maximum Flow Applications
|
|
- Alisha Neal
- 6 years ago
- Views:
Transcription
1 Chapter 5 Graph Algorithms Maximum Flow Applications Algorithm Theory WS 202/3 Fabian Kuhn
2 Maximum Flow Applications Maximum flow has many applications Reducing a problem to a max flow problem can even be seen as an important algorithmic technique Examples: related network flow problems computation of small cuts computation of matchings computing disjoint paths scheduling problems assignment problems with some side constraints Algorithm Theory, WS 202/3 Fabian Kuhn 2
3 Undirected Edges and Vertex Capacities Undirected Edges: Undirected edge, : add edges, and, to network Vertex Capacities: Not only edge, but also (or only) nodes have capacities Capacity of node,: Replace node by edge, : Algorithm Theory, WS 202/3 Fabian Kuhn 3
4 Minimum Cut Given: undirected graph,, nodes, cut: Partition, of such that, Size of cut, : number of edges crossing the cut Objective: find cut of minimum size Algorithm Theory, WS 202/3 Fabian Kuhn 4
5 Edge Connectivity Definition: A graph, is edge connected for an integer if the graph, is connected for every edge set,. Goal: Compute edge connectivity of (and edge set of size that divides into 2parts) minimum set is a minimum cut for some, Actually for all, in different components of, Possible algorithm: fix and find min cut for all Algorithm Theory, WS 202/3 Fabian Kuhn 5
6 Minimum Vertex Cut Given: undirected graph,, nodes, vertex cut: Set such that, and and are in different components of the sub graph induced by Size of vertex cut: Objective: find vertex cut of minimum size Replace undirected edge, by, and, Compute max flow for edge capacities and node capacities for, Replace each node by and : Min edge cut corresponds to min vertex cut in Algorithm Theory, WS 202/3 Fabian Kuhn 6
7 Vertex Connectivity Definition: A graph, is vertex connected for an integer if the sub graph induced by is connected for every edge set,. Goal: Compute vertex connectivity of (and node set of size that divides into 2parts) Compute minimum vertex cut for fixed and all Algorithm Theory, WS 202/3 Fabian Kuhn 7
8 Edge Disjoint Paths Given: Graph,with nodes, Goal: Find as many edge disjoint paths as possible Solution: Find max flow in with edge capacities for all Flow induces edge disjoint paths: Integral capacities can compute integral max flow Get edge disjoint paths by greedily picking them Correctness follows from flow conservation Algorithm Theory, WS 202/3 Fabian Kuhn 8
9 Edge Disjoint Paths Flow induces edge disjoint paths: Get edge disjoint paths by greedily picking them Algorithm Theory, WS 202/3 Fabian Kuhn 9
10 Edge Disjoint Paths Flow induces edge disjoint paths: Get edge disjoint paths by greedily picking them Algorithm Theory, WS 202/3 Fabian Kuhn 0
11 Edge Disjoint Paths Flow induces edge disjoint paths: Decompose into one path and a flow of value Algorithm Theory, WS 202/3 Fabian Kuhn
12 Vertex Disjoint Paths Given: Graph,with nodes, Goal: Find as many internally vertex disjoint paths as possible Solution: Find max flow in with node capacities for all Flow induces vertex disjoint paths: Integral capacities can compute integral max flow Get vertex disjoint paths by greedily picking them Correctness follows from flow conservation Algorithm Theory, WS 202/3 Fabian Kuhn 2
13 Menger s Theorem Theorem: (Menger s theorem, edge version) For every graph,with nodes,, the minimum number of edges that need to be removed to disconnect and equals the maximum number of pairwise edge disjoint paths from to. Theorem: (Menger s theorem, node version) For every graph,with nodes,, the minimum number of nodes,that need to be removed to disconnect and equals the maximum number of pairwise internally vertexdisjoint paths from to Both versions can be seen as a special case of the max flow min cut theorem Algorithm Theory, WS 202/3 Fabian Kuhn 3
14 Baseball Elimination Team Wins Losses To Play Against = l NY Balt. T. Bay Tor. Bost. New York Baltimore Tampa Bay Toronto Boston Only wins/losses possible (no ties), winner: team with most wins Which teams can still win (as least as many wins as top team)? Boston is eliminated (cannot win): Boston can get at most 79 wins, New York already has 8 wins If for some, : team is eliminated Sufficient condition, but not a necessary one! Algorithm Theory, WS 202/3 Fabian Kuhn 4
15 Baseball Elimination Team Wins Losses To Play Against = l NY Balt. T. Bay Tor. Bost. New York Baltimore Tampa Bay Toronto Boston Can Toronto still finish first? Toronto can get 82 8 wins, but: NY and Tampa have to play 4 more times against each other if NY wins one, it gets 82 wins, otherwise, Tampa has 82 wins Hence: Toronto cannot finish first How about the others? How can we solve this in general? Algorithm Theory, WS 202/3 Fabian Kuhn 5
16 Max Flow Formulation Can team 3 finish with most wins? Remaining number of games between the 2 teams game nodes 5 team nodes Number of wins team can have to not beat team Team 3 can finish first iff all source game edges are saturated Algorithm Theory, WS 202/3 Fabian Kuhn 6
17 Reason for Elimination AL East: Aug 30, 996 Team Wins Losses To Play Against = l NY Balt. Bost. Tor. Detr. New York Baltimore Boston Toronto Detroit Detroit could finish with wins Consider NY, Bal, Bos, Tor Have together already won 278 games Must together win at least 27more games On average, teams in win games Algorithm Theory, WS 202/3 Fabian Kuhn 7
18 Reason for Elimination Certificate of elimination:,,,, #wins of nodes in #remaining games among nodes in Team is eliminated by if. Algorithm Theory, WS 202/3 Fabian Kuhn 8
19 Reason for Elimination Theorem: Team is eliminated if and only if there exists a subset of the teams such that is eliminated by. Proof Idea: Minimum cut gives a certificate If is eliminated, max flow solution does not saturate all outgoing edges of the source. Team nodes of unsaturated source game edges are saturated Source side of min cut contains all teams of saturated team dest. edges of unsaturated source game edges Set of team nodes in source side of min cut give a certificate Algorithm Theory, WS 202/3 Fabian Kuhn 9
20 Circulations with Demands Given: Directed network with positive edge capacities Sources & Sinks: Instead of one source and one destination, several sources that generate flow and several sinks that absorb flow. Supply & Demand: sources have supply values, sinks demand values Goal: Compute a flow such that source supplies and sink demands are exactly satisfied The circulation problem is a feasibility rather than a maximization problem Algorithm Theory, WS 202/3 Fabian Kuhn 20
21 Circulations with Demands: Formally Given: Directed network, with Edge capacities 0for all Node demands for all 0: node needs flow and therefore is a sink 0: node has a supply of and is therefore a source 0: node is neither a source nor a sink Flow: Function : satisfying Capacity Conditions: : 0 Demand Conditions: : Objective: Does a flow satisfying all conditions exist? If yes, find such a flow. Algorithm Theory, WS 202/3 Fabian Kuhn 2
22 Example Algorithm Theory, WS 202/3 Fabian Kuhn 22
23 Condition on Demands Claim: If there exists a feasible circulation with demands for, then Proof: 0. of each edge appears twice in the above sum with different signs overall sum is 0 Total supply = total demand: Define : : Algorithm Theory, WS 202/3 Fabian Kuhn 23
24 Reduction to Maximum Flow Add super source and super sink to network 0 0 supplies sources with flow siphons flow out of sinks Algorithm Theory, WS 202/3 Fabian Kuhn 24
25 Example Algorithm Theory, WS 202/3 Fabian Kuhn 25
26 Formally Reduction: Get graph from graph as follows Node set of is, Edge set is and edges,for all with 0, capacity of edge is, for all with 0, capacity of edge is Observations: Capacity of min cut is at least (e.g., the cut, A feasible circulation on can be turned into a feasible flow of value of by saturating all,and, edges. Any flow of of value induces a feasible circulation on, and, edges are saturated By removing these edges, we get exactly the demand constraints Algorithm Theory, WS 202/3 Fabian Kuhn 26
27 Circulation with Demands Theorem: There is a feasible circulation with demands, on graph if and only if there is a flow of value on. If all capacities and demands are integers, there is an integer circulation The max flow min cut theorem also implies the following: Theorem: The graph has a feasible circulation with demands, if and only if for all cuts,,,. Algorithm Theory, WS 202/3 Fabian Kuhn 27
28 Circulation: Demands and Lower Bounds Given: Directed network, with Edge capacities 0and lower bounds l for Node demands for all 0: node needs flow and therefore is a sink 0: node has a supply of and is therefore a source 0: node is neither a source nor a sink Flow: Function : satisfying Capacity Conditions: : l Demand Conditions: : Objective: Does a flow satisfying all conditions exist? If yes, find such a flow. Algorithm Theory, WS 202/3 Fabian Kuhn 28
29 Solution Idea Define initial circulation l Satisfies capacity constraints: : l Define l l If 0, demand condition is satisfied at by, otherwise, we need to superimpose another circulation such that Remaining capacity of edge : l We get a circulation problem with new demands, new capacities, and no lower bounds Algorithm Theory, WS 202/3 Fabian Kuhn 29
30 Eliminating a Lower Bound: Example Lower bound of Algorithm Theory, WS 202/3 Fabian Kuhn 30
31 Reduce to Problem Without Lower Bounds Graph, : Capacity: For each edge : l Demand: For each node : Model lower bounds with supplies & demands: Flow: l Create Network (without lower bounds): For each edge : l For each node : Algorithm Theory, WS 202/3 Fabian Kuhn 3
32 Circulation: Demands and Lower Bounds Theorem: There is a feasible circulation in (with lower bounds) if and only if there is feasible circulation in (without lower bounds). Given circulation in, l is circulation in The capacity constraints are satisfied because l Demand conditions: l l Given circulation in, l is circulation in The capacity constraints are satisfied because l Demand conditions: l l Algorithm Theory, WS 202/3 Fabian Kuhn 32
33 Integrality Theorem: Consider a circulation problem with integral capacities, flow lower bounds, and node demands. If the problem is feasible, then it also has an integral solution. Proof: Graph has only integral capacities and demands Thus, the flow network used in the reduction to solve circulation with demands and no lower bounds has only integral capacities The theorem now follows because a max flow problem with integral capacities also has an optimal integral solution It also follows that with the max flow algorithms we studied, we get an integral feasible circulation solution. Algorithm Theory, WS 202/3 Fabian Kuhn 33
Chapter 5 Graph Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn
Chapter 5 Graph Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Graphs Extremely important concept in computer science Graph, : node (or vertex) set : edge set Simple graph: no self loops, no multiple
More informationGraph Algorithms Matching
Chapter 5 Graph Algorithms Matching Algorithm Theory WS 2012/13 Fabian Kuhn Circulation: Demands and Lower Bounds Given: Directed network, with Edge capacities 0and lower bounds l for Node demands for
More information7. NETWORK FLOW II. bipartite matching disjoint paths extensions to max flow survey design airline scheduling image segmentation project selection
7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow survey design airline scheduling image segmentation project selection Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison
More information7. NETWORK FLOW II. Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley Copyright 2013 Kevin Wayne
7. NETWORK FLOW II Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley Copyright 203 Kevin Wayne http://www.cs.princeton.edu/~wayne/kleinberg-tardos bipartite matching disjoint paths extensions
More informationJessica Su (some parts copied from CLRS / last quarter s notes)
1 Max flow Consider a directed graph G with positive edge weights c that define the capacity of each edge. We can identify two special nodes in G: the source node s and the sink node t. We want to find
More informationLecture 11: Maximum flow and minimum cut
Optimisation Part IB - Easter 2018 Lecture 11: Maximum flow and minimum cut Lecturer: Quentin Berthet 4.4. The maximum flow problem. We consider in this lecture a particular kind of flow problem, with
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 10
CPSC 536N: Randomized Algorithms 011-1 Term Prof. Nick Harvey Lecture 10 University of British Columbia In the first lecture we discussed the Max Cut problem, which is NP-complete, and we presented a very
More informationGraphs and Network Flows IE411. Lecture 13. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 13 Dr. Ted Ralphs IE411 Lecture 13 1 References for Today s Lecture IE411 Lecture 13 2 References for Today s Lecture Required reading Sections 21.1 21.2 References
More informationClassic Graph Theory Problems
Classic Graph Theory Problems Hiroki Sayama sayama@binghamton.edu The Origin Königsberg bridge problem Pregel River (Solved negatively by Euler in 176) Representation in a graph Can all the seven edges
More informationMaximum flows & Maximum Matchings
Chapter 9 Maximum flows & Maximum Matchings This chapter analyzes flows and matchings. We will define flows and maximum flows and present an algorithm that solves the maximum flow problem. Then matchings
More informationApproximation Algorithms
Chapter 8 Approximation Algorithms Algorithm Theory WS 2016/17 Fabian Kuhn Approximation Algorithms Optimization appears everywhere in computer science We have seen many examples, e.g.: scheduling jobs
More informationTutorial for Algorithm s Theory Problem Set 5. January 17, 2013
Tutorial for Algorithm s Theory Problem Set 5 January 17, 2013 Exercise 1: Maximum Flow Algorithms Consider the following flow network: a) Solve the maximum flow problem on the above network by using the
More informationMinimum Cost Edge Disjoint Paths
Minimum Cost Edge Disjoint Paths Theodor Mader 15.4.2008 1 Introduction Finding paths in networks and graphs constitutes an area of theoretical computer science which has been highly researched during
More informationCONNECTIVITY AND NETWORKS
CONNECTIVITY AND NETWORKS We begin with the definition of a few symbols, two of which can cause great confusion, especially when hand-written. Consider a graph G. (G) the degree of the vertex with smallest
More informationCPCS Discrete Structures 1
Let us switch to a new topic: Graphs CPCS 222 - Discrete Structures 1 Introduction to Graphs Definition: A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationNetwork flows and Menger s theorem
Network flows and Menger s theorem Recall... Theorem (max flow, min cut strong duality). Let G be a network. The maximum value of a flow equals the minimum capacity of a cut. We prove this strong duality
More informationCSE 417 Network Flows (pt 3) Modeling with Min Cuts
CSE 417 Network Flows (pt 3) Modeling with Min Cuts Reminders > HW6 is due on Friday start early bug fixed on line 33 of OptimalLineup.java: > change true to false Review of last two lectures > Defined
More informationDiscrete Wiskunde II. Lecture 6: Planar Graphs
, 2009 Lecture 6: Planar Graphs University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Planar Graphs Given an undirected graph (or multigraph) G = (V, E). A planar embedding of G is
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationBipartite Matching & the Hungarian Method
Bipartite Matching & the Hungarian Method Last Revised: 15/9/7 These notes follow formulation originally developed by Subhash Suri in http://www.cs.ucsb.edu/ suri/cs/matching.pdf We previously saw how
More informationPaths, Flowers and Vertex Cover
Paths, Flowers and Vertex Cover Venkatesh Raman, M.S. Ramanujan, and Saket Saurabh Presenting: Hen Sender 1 Introduction 2 Abstract. It is well known that in a bipartite (and more generally in a Konig)
More information6 Randomized rounding of semidefinite programs
6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can
More informationV10 Metabolic networks - Graph connectivity
V10 Metabolic networks - Graph connectivity Graph connectivity is related to analyzing biological networks for - finding cliques - edge betweenness - modular decomposition that have been or will be covered
More informationGraph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow
Graph Theory Connectivity, Coloring, Matching Arjun Suresh 1 1 GATE Overflow GO Classroom, August 2018 Thanks to Subarna/Sukanya Das for wonderful figures Arjun, Suresh (GO) Graph Theory GATE 2019 1 /
More informationOutline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem
Outline: Finish uncapacitated simplex method Negative cost cycle algorithm The max-flow problem Max-flow min-cut theorem Uncapacitated Networks: Basic primal and dual solutions Flow conservation constraints
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.854J / 18.415J Advanced Algorithms Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advanced
More informationNotes for Lecture 20
U.C. Berkeley CS170: Intro to CS Theory Handout N20 Professor Luca Trevisan November 13, 2001 Notes for Lecture 20 1 Duality As it turns out, the max-flow min-cut theorem is a special case of a more general
More informationby conservation of flow, hence the cancelation. Similarly, we have
Chapter 13: Network Flows and Applications Network: directed graph with source S and target T. Non-negative edge weights represent capacities. Assume no edges into S or out of T. (If necessary, we can
More informationCharacterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)
S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G
More informationFinding Strongly Connected Components
Yufei Tao ITEE University of Queensland We just can t get enough of the beautiful algorithm of DFS! In this lecture, we will use it to solve a problem finding strongly connected components that seems to
More informationarxiv: v2 [math.co] 13 Aug 2013
Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed
More informationCSC 505, Fall 2000: Week 12
CSC 505, Fall 000: Week Proving the N P-completeness of a decision problem A:. Prove that A is in N P give a simple guess and check algorithm (the certificate being guessed should be something requiring
More informationSolution for Homework set 3
TTIC 300 and CMSC 37000 Algorithms Winter 07 Solution for Homework set 3 Question (0 points) We are given a directed graph G = (V, E), with two special vertices s and t, and non-negative integral capacities
More informationAnalysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks
Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks Seminar of Distributed Computing WS 04/05 ETH Zurich, 1.2.2005 Nicolas Born nborn@student.ethz.ch Paper Analysis of Link Reversal
More informationCuts and Disjoint Paths in the Valley-Free Path Model
Cuts and Disjoint Paths in the Valley-Free Path Model Thomas Erlebach Alexander Hall Alessandro Panconesi Danica Vukadinović October 30, 2005 Abstract In the valley-free path model, a path in a given directed
More informationCSE 417 Network Flows (pt 4) Min Cost Flows
CSE 417 Network Flows (pt 4) Min Cost Flows Reminders > HW6 is due Monday Review of last three lectures > Defined the maximum flow problem find the feasible flow of maximum value flow is feasible if it
More informationApproximation Algorithms
Approximation Algorithms Given an NP-hard problem, what should be done? Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one of three desired features. Solve problem to optimality.
More informationIn this lecture, we ll look at applications of duality to three problems:
Lecture 7 Duality Applications (Part II) In this lecture, we ll look at applications of duality to three problems: 1. Finding maximum spanning trees (MST). We know that Kruskal s algorithm finds this,
More informationSource. Sink. Chapter 10: Iterative Programming Maximum Flow Problem. CmSc250 Intro to Algorithms
Chapter 10: Iterative Programming Maximum Flow Problem CmSc20 Intro to Algorithms A flow network is a model of a system where some material is produced at its source, travels through the system, and is
More informationGraph Theory: Matchings and Factors
Graph Theory: Matchings and Factors Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT Kharagpur pallab@cse.iitkgp.ernet.in Matchings A matching of size k in a graph G is a set of k
More informationCAP 5993/CAP 4993 Game Theory. Instructor: Sam Ganzfried
CAP 5993/CAP 4993 Game Theory Instructor: Sam Ganzfried sganzfri@cis.fiu.edu 1 Announcements HW 1 due today HW 2 out this week (2/2), due 2/14 2 Definition: A two-player game is a zero-sum game if for
More informationarxiv: v2 [cs.cc] 29 Mar 2010
On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem. arxiv:1003.3704v2 [cs.cc] 29 Mar 2010 Peiyush Jain, Microsoft Corporation. June 28, 2018 Abstract In this paper we define a restricted
More information12 Introduction to LP-Duality
12 Introduction to LP-Duality A large fraction of the theory of approximation algorithms, as we know it today, is built around linear programming (LP). In Section 12.1 we will review some key concepts
More informationMa/CS 6b Class 4: Matchings in General Graphs
Ma/CS 6b Class 4: Matchings in General Graphs By Adam Sheffer Reminder: Hall's Marriage Theorem Theorem. Let G = V 1 V 2, E be a bipartite graph. There exists a matching of size V 1 in G if and only if
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationAssignment 1 Introduction to Graph Theory CO342
Assignment 1 Introduction to Graph Theory CO342 This assignment will be marked out of a total of thirty points, and is due on Thursday 18th May at 10am in class. Throughout the assignment, the graphs are
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationTheory of Computing. Lecture 10 MAS 714 Hartmut Klauck
Theory of Computing Lecture 10 MAS 714 Hartmut Klauck Seven Bridges of Königsberg Can one take a walk that crosses each bridge exactly once? Seven Bridges of Königsberg Model as a graph Is there a path
More informationCMPSCI 311: Introduction to Algorithms Practice Final Exam
CMPSCI 311: Introduction to Algorithms Practice Final Exam Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Providing more detail including
More informationPaths. Path is a sequence of edges that begins at a vertex of a graph and travels from vertex to vertex along edges of the graph.
Paths Path is a sequence of edges that begins at a vertex of a graph and travels from vertex to vertex along edges of the graph. Formal Definition of a Path (Undirected) Let n be a nonnegative integer
More informationSteiner Trees and Forests
Massachusetts Institute of Technology Lecturer: Adriana Lopez 18.434: Seminar in Theoretical Computer Science March 7, 2006 Steiner Trees and Forests 1 Steiner Tree Problem Given an undirected graph G
More informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
More informationChapter 1 Divide and Conquer Algorithm Theory WS 2013/14 Fabian Kuhn
Chapter 1 Divide and Conquer Algorithm Theory WS 2013/14 Fabian Kuhn Number of Inversions Formal problem: Given: array,,,, of distinct elements Objective: Compute number of inversions 0 Example: 4, 1,
More informationCS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved.
More informationGraphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University
Graphs: Introduction Ali Shokoufandeh, Department of Computer Science, Drexel University Overview of this talk Introduction: Notations and Definitions Graphs and Modeling Algorithmic Graph Theory and Combinatorial
More informationMatching Theory. Figure 1: Is this graph bipartite?
Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationAbstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.
Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph
More informationLecture 21: Other Reductions Steven Skiena
Lecture 21: Other Reductions Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.stonybrook.edu/ skiena Problem of the Day Show that the dense
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
More informationByzantine Consensus in Directed Graphs
Byzantine Consensus in Directed Graphs Lewis Tseng 1,3, and Nitin Vaidya 2,3 1 Department of Computer Science, 2 Department of Electrical and Computer Engineering, and 3 Coordinated Science Laboratory
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/27/18 22.1 Introduction We spent the last two lectures proving that for certain problems, we can
More informationThe Simplex Algorithm for LP, and an Open Problem
The Simplex Algorithm for LP, and an Open Problem Linear Programming: General Formulation Inputs: real-valued m x n matrix A, and vectors c in R n and b in R m Output: n-dimensional vector x There is one
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More informationModule 11. Directed Graphs. Contents
Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................
More information9.1 Cook-Levin Theorem
CS787: Advanced Algorithms Scribe: Shijin Kong and David Malec Lecturer: Shuchi Chawla Topic: NP-Completeness, Approximation Algorithms Date: 10/1/2007 As we ve already seen in the preceding lecture, two
More informationGraphs. Pseudograph: multiple edges and loops allowed
Graphs G = (V, E) V - set of vertices, E - set of edges Undirected graphs Simple graph: V - nonempty set of vertices, E - set of unordered pairs of distinct vertices (no multiple edges or loops) Multigraph:
More informationAMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.
AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a
More informationMa/CS 6b Class 10: Ramsey Theory
Ma/CS 6b Class 10: Ramsey Theory By Adam Sheffer The Pigeonhole Principle The pigeonhole principle. If n items are put into m containers, such that n > m, then at least one container contains more than
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationApproximation Algorithms: The Primal-Dual Method. My T. Thai
Approximation Algorithms: The Primal-Dual Method My T. Thai 1 Overview of the Primal-Dual Method Consider the following primal program, called P: min st n c j x j j=1 n a ij x j b i j=1 x j 0 Then the
More informationGraphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationMa/CS 6b Class 12: Ramsey Theory
Ma/CS 6b Class 12: Ramsey Theory By Adam Sheffer The Pigeonhole Principle The pigeonhole principle. If n items are put into m containers, such that n > m, then at least one container contains more than
More informationDatenstrukturen & Algorithmen Solution of Sheet 11 FS 14
Eidgenössische Technische Hochschule Zürich Ecole polytechnique fédérale de Zurich Politecnico federale di Zurigo Federal Institute of Technology at Zurich Institut für Theoretische Informatik 14th May
More informationSolving problems on graph algorithms
Solving problems on graph algorithms Workshop Organized by: ACM Unit, Indian Statistical Institute, Kolkata. Tutorial-3 Date: 06.07.2017 Let G = (V, E) be an undirected graph. For a vertex v V, G {v} is
More informationGRAPH DECOMPOSITION BASED ON DEGREE CONSTRAINTS. March 3, 2016
GRAPH DECOMPOSITION BASED ON DEGREE CONSTRAINTS ZOÉ HAMEL March 3, 2016 1. Introduction Let G = (V (G), E(G)) be a graph G (loops and multiple edges not allowed) on the set of vertices V (G) and the set
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationExercise set 2 Solutions
Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T
More informationRestricted edge connectivity and restricted connectivity of graphs
Restricted edge connectivity and restricted connectivity of graphs Litao Guo School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Xiaofeng Guo
More informationP and NP CISC4080, Computer Algorithms CIS, Fordham Univ. Instructor: X. Zhang
P and NP CISC4080, Computer Algorithms CIS, Fordham Univ. Instructor: X. Zhang Efficient Algorithms So far, we have developed algorithms for finding shortest paths in graphs, minimum spanning trees in
More informationMinimum cut application (RAND 1950s)
Minimum cut application (RAND 950s) Free world goal. Cut supplies (if Cold War turns into real war). rail network connecting Soviet Union with Eastern European countries (map declassified by Pentagon in
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationThe complement of PATH is in NL
340 The complement of PATH is in NL Let c be the number of nodes in graph G that are reachable from s We assume that c is provided as an input to M Given G, s, t, and c the machine M operates as follows:
More informationNotes for Lecture 24
U.C. Berkeley CS170: Intro to CS Theory Handout N24 Professor Luca Trevisan December 4, 2001 Notes for Lecture 24 1 Some NP-complete Numerical Problems 1.1 Subset Sum The Subset Sum problem is defined
More informationSolutions for the Exam 6 January 2014
Mastermath and LNMB Course: Discrete Optimization Solutions for the Exam 6 January 2014 Utrecht University, Educatorium, 13:30 16:30 The examination lasts 3 hours. Grading will be done before January 20,
More informationGraph Connectivity G G G
Graph Connectivity 1 Introduction We have seen that trees are minimally connected graphs, i.e., deleting any edge of the tree gives us a disconnected graph. What makes trees so susceptible to edge deletions?
More informationMatchings in Graphs. Definition 1 Let G = (V, E) be a graph. M E is called as a matching of G if v V we have {e M : v is incident on e E} 1.
Lecturer: Scribe: Meena Mahajan Rajesh Chitnis Matchings in Graphs Meeting: 1 6th Jan 010 Most of the material in this lecture is taken from the book Fast Parallel Algorithms for Graph Matching Problems
More informationSmall Survey on Perfect Graphs
Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into
More information[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH S. Sethu Ramalingam * 1, I. Keerthi Asir 2 and S. Athisayanathan 3 *1,2 & 3 Department of Mathematics,
More informationTraveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost
Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R
More informationMathematics Masters Examination
Mathematics Masters Examination OPTION 4 Fall 2011 COMPUTER SCIENCE??TIME?? NOTE: Any student whose answers require clarification may be required to submit to an oral examination. Each of the twelve numbered
More informationP and NP CISC5835, Algorithms for Big Data CIS, Fordham Univ. Instructor: X. Zhang
P and NP CISC5835, Algorithms for Big Data CIS, Fordham Univ. Instructor: X. Zhang Efficient Algorithms So far, we have developed algorithms for finding shortest paths in graphs, minimum spanning trees
More informationXLVI Pesquisa Operacional na Gestão da Segurança Pública
Setembro de 014 Approximation algorithms for simple maxcut of split graphs Rubens Sucupira 1 Luerbio Faria 1 Sulamita Klein 1- IME/UERJ UERJ, Rio de JaneiroRJ, Brasil rasucupira@oi.com.br, luerbio@cos.ufrj.br
More informationCuts, Connectivity, and Flow
Cuts, Connectivity, and Flow Vertex Cut and Connectivity A separating set or vertex cut of a graph G is a set S V(G) such that G S G S has more than one component A graph G is k-connected if every vertex
More informationSection 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected
Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected graph G with at least 2 vertices contains at least 2
More informationand 6.855J March 6, Maximum Flows 2
5.08 and.855j March, 00 Maximum Flows Network Reliability Communication Network What is the maximum number of arc disjoint paths from s to t? How can we determine this number? Theorem. Let G = (N,A) be
More information