Dinic Max Flow Algorithm Slides by Dominik Scheder Part I Dinic - PowerPoint PPT Presentation

Sep 12, 2023 •365 likes •2.22k views

Dinic Max Flow Algorithm Slides by Dominik Scheder Part I Dinic Algorithm in General Flow Networks 2 4 2 1 3 3 1 2 3 t 3 3 1 2 s 4 4 2 1 3 3 3 3 2 4 2 1 3 3 1 2 3 t 3 3 1 2 s 4 4 2 1 3 3 3 3

2 4 (2) (1) (2) 2 1 3 3 1 2 3 (1) (1) t (1) 3 3 1 2 s 4 4 2 1 3 3 3 3 Collect the flow of this phase.
2 4 (2) (1) (3) 2 1 3 3 (1) 1 2 3 (1) (1) t (1) 3 3 1 2 s 4 (1) 4 2 (1) 1 3 3 3 3 Collect the flow of this phase.
2 4 (2) (1) (3) 2 1 3 3 (1) 1 2 3 (1) (1) t (1) 3 3 1 2 s 4 (1) 4 2 (1) 1 3 3 3 3 Collect the flow of this phase.
2 4 (2) (1) (3) 2 1 3 3 (1) 1 2 3 (1) (1) t (1) 3 3 1 2 s 4 (1) 4 2 (1) 1 3 3 3 3 Collect the flow of this phase.
2 4 (2) (1) (3) 2 1 3 3 (1) 1 2 3 (1) (1) t (1) 3 3 1 2 s 4 (1) 4 2 (2) 1 3 3 (1) 3 (1) 3 (1) Collect the flow of this phase.
2 4 (2) (1) (3) 2 1 3 3 (1) 1 2 3 (1) (1) t (1) 3 3 1 2 s 4 (1) 4 2 (2) 1 3 3 (1) 3 (1) 3 (1) Collect the flow of this phase.
2 4 (2) (1) (3) 2 1 3 3 (1) 1 2 3 (1) (1) t (1) 3 3 1 2 s 4 (1) 4 2 (2) 1 3 3 (1) 3 (1) 3 (1) Collect the flow of this phase. Observation: Only edges on a shortest s - t -path carry flow.
2 4 (2) (1) (3) 2 1 3 3 (1) 1 2 3 (1) (1) t (1) 3 3 1 2 s 4 (1) 4 2 (2) 1 3 3 (1) 3 (1) 3 (1) Collect the flow of this phase. Observation: Only edges on a shortest s - t -path carry flow. Build residual network (and introduce back edges)!
2 1 1 2 3 1 1 2 3 1 2 1 1 t 1 3 3 2 s 4 4 2 2 1 2 1 1 1 2 2 1 Collect the flow of this phase. Observation: Only edges on a shortest s - t -path carry flow. Build residual network (and introduce back edges)!
2 4 2 1 3 3 1 2 3 t 3 3 1 2 s 4 4 2 1 3 3 3 3
2 4 2 1 3 3 1 2 3 t 3 3 1 2 s 4 4 2 1 3 3 3 3 dist ( s, t ) = 4 in the original network.
2 1 1 2 3 1 1 2 3 1 2 1 1 t 1 3 3 2 s 4 4 2 2 1 2 1 1 1 2 2 1 dist ( s, t ) = 4 in the original network.
2 1 1 2 3 1 1 2 3 1 2 1 1 t 1 3 3 2 s 4 4 2 2 1 2 1 1 1 2 2 1 dist ( s, t ) = 4 in the original network. Back edges go backwards. Not part of any length- 4 -path.
2 1 1 2 3 1 1 2 3 1 2 1 1 t 1 3 3 2 s 4 4 2 2 1 2 1 1 1 2 2 1 dist ( s, t ) = 4 in the original network. Back edges go backwards. Not part of any length- 4 -path. dist ( s, t ) > 4 in the residual network.
Runtime Analysis
dist ( s, t ) increases in every phase.

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

The Assignment Problem E.A Dinic, M.A Kronrod Moscow State University Soviet Math.Dokl. 1969

Introduction Algorithm The Assignment Problem E.A Dinic, M.A Kronrod Moscow State University Soviet Math.Dokl. 1969 January 30, 2012 E.A Dinic and M.A Kronrod Introduction Algorithm 1 Introduction Motivation Problem Definition 2 Algorithm

714 views • 69 slides

Review. Ford-Fulkerson algorithm for max-flow: repeatedly augment flow along paths in the

Review. Ford-Fulkerson algorithm for max-flow: repeatedly augment flow along paths in the residual graph If capacities are integers, F-F finds an integer valued flow Running time: O((m+n)OPT), where OPT is the value of the max flow

836 views • 30 slides

EFFICIENT MAXIMUM FLOW ALGORITHM Nikolay Sakharnykh Hugo Braun; May 10, 2017 MAXIMUM FLOW

EFFICIENT MAXIMUM FLOW ALGORITHM Nikolay Sakharnykh Hugo Braun; May 10, 2017 MAXIMUM FLOW Definition Example : How much instant power can Palo Alto get using that electric grid? s 30 25 Power SF plant 1 8 20 Directed graph

692 views • 36 slides

Graph Algorithms Maximum Flow Applications Algorithm Theory WS 2012/13 Fabian Kuhn Maximum Flow

Chapter 5 Graph Algorithms Maximum Flow Applications Algorithm Theory WS 2012/13 Fabian Kuhn Maximum Flow Applications Maximum flow has many applications Reducing a problem to a max flow problem can even be seen as an important algorithmic

464 views • 33 slides

Review Network flow definitions CSE 421 Flow examples Augmenting Paths Algorithms

Review Network flow definitions CSE 421 Flow examples Augmenting Paths Algorithms g Residual Graph Richard Anderson Ford Fulkerson Algorithm Lecture 22 Cuts Network Flow Maxflow-MinCut Theorem Network Flow

860 views • 4 slides

A Queue Management A Queue Management Algorithm for Intra- -Flow Flow Algorithm for Intra

A Queue Management A Queue Management Algorithm for Intra- -Flow Flow Algorithm for Intra Service Differentiation Differentiation in in the the Service Best Effort Best Effort Internet Internet Henning Sanneck GMD

360 views • 14 slides

1 Ways to improve data-flow analysis efficiency Example (liveness) 1st 2nd 3rd

Speeding Up Data-Flow Analysis Solving the Data-flow Equations Last time Algorithm Various optimizations that use data-flow analysis for each node n in CFG initialize solutions in[n] = ; out[n] = Today repeat Speeding up

418 views • 4 slides

Python Session # 3 By: Saeed Haratian Spring 2016 Outlines Algorithm Flow Chart

Fundamentals of Programming Python Session # 3 By: Saeed Haratian Spring 2016 Outlines Algorithm Flow Chart Pseudo Code Algorithm Before writing a program to solve

384 views • 10 slides

Network Flow-based Bipartitioning Perform flow-based bipartitioning under: Area constraint

Network Flow-based Bipartitioning Perform flow-based bipartitioning under: Area constraint [4,5] Source = a , sink = i Break ties alphabetically Practical Problems in VLSI Physical Design FBB Algorithm (1/6) First Max-Flow and Its

87 views • 6 slides

The Binary Blocking Flow Algorithm Andrew V. Goldberg Microsoft Research Silicon Valley

The Binary Blocking Flow Algorithm Andrew V. Goldberg Microsoft Research Silicon Valley www.research.microsoft.com/ goldberg/ Why this Max-Flow Talk? O (min( n 2 / 3 , m 1 / 2 ) m log( n 2 /m ) log( U )) maximum The result: flow

342 views • 21 slides

Flow Networks Flow Network: - digraph - weights, called capacities on edges - two

M AXIMUM F LOW How to do it... Why you want it... Where you find it... The Tao of Flow: Let your body go with the flow. -Madonna, Vogue Maximum flow...because youre worth it. -Loreal Go with the flow, Joe.

619 views • 20 slides

Today Flow review Augmenting paths Ford-Fulkerson Algorithm Intro to cuts (reason: prove

Today Flow review Augmenting paths Ford-Fulkerson Algorithm Intro to cuts (reason: prove correctness) Flow Networks s = source, t = sink. c(e) = capacity of edge e Capacity condition: 0 f(e) c(e) Conservation condition: for v V

494 views • 28 slides

Network Flow Algorithm Design Divide and Dynamic Greedy Conquer Programming Formulate

Network Flow Algorithm Design Divide and Dynamic Greedy Conquer Programming Formulate problem ? ? ? Design algorithm less work more work more work Prove correctness more work less work less work Analyze running time less work

520 views • 18 slides

MCMC algorithm for investigating variation in traffic flow Toshiyuki Yamamoto Nagoya University

MCMC algorithm for investigating variation in traffic flow Toshiyuki Yamamoto Nagoya University Introduction Needs for complex traffic control and emerging driver information systems have led to increasing interests in: Stochastic

501 views • 27 slides

Solving the Multi-Commodity Flow Problem using a Multi-Objective Genetic Algorithm Noel Farrugia,

Solving the Multi-Commodity Flow Problem using a Multi-Objective Genetic Algorithm Noel Farrugia, Johann A. Briffa, Victor Buttigieg Department of Communications and Computer Engineering University Of Malta Introduction Compared to 2015,

485 views • 21 slides

PROGRAMMING CONTESTS Jaehyun Park Last Lecture on Graph Algorithms Network Flow Problems

CS 97SI: INTRODUCTION TO PROGRAMMING CONTESTS Jaehyun Park Last Lecture on Graph Algorithms Network Flow Problems Maximum Flow Minimum Cut Ford-Fulkerson Algorithm Application: Bipartite Matching Min-cost Max-flow

460 views • 23 slides

Implementing Geometric Algorithms for Real-World Applications With and Without EGC-Support Stefan

Implementing Geometric Algorithms for Real-World Applications With and Without EGC-Support Stefan Huber 1 Martin Held 2 1 Institute of Science and Technology Austria 2 FB Computerwissenschaften Universit at Salzburg, Austria GCC 2013, Rio de

1.42k views • 65 slides

Scientific Computing I Module 7: Grid Generation Michael Bader Winter 2009/2010 Michael Bader:

Lehrstuhl Informatik V Scientific Computing I Module 7: Grid Generation Michael Bader Winter 2009/2010 Michael Bader: Scientific Computing I Module 7: Grid Generation, Winter 2009/2010 1 Lehrstuhl Informatik V Grid Generation and Refinement

239 views • 19 slides

On Plane Constrained Bounded-Degree Spanners Prosenjit Bose, Rolf Fagerberg, Andr e van Renssen

On Plane Constrained Bounded-Degree Spanners Prosenjit Bose, Rolf Fagerberg, Andr e van Renssen and Sander Verdonschot Carleton University, University of Southern Denmark April 15, 2012 Sander Verdonschot (Carleton University) Constrained

1.17k views • 48 slides

Triangulated ternary disc packings that maximize the density Daria Pchelina supervised by

Triangulated ternary disc packings that maximize the density Daria Pchelina supervised by Thomas Fernique September 29, 2020 Daria Pchelina supervised by Thomas Fernique September 29, 2020 1 / 15 What is a packing? Discs: r s 1 Packing

797 views • 44 slides

CSE 421 Introduction to Algorithms The Network Flow Problem 1 The Network Flow Problem 4 a x

CSE 421 Introduction to Algorithms The Network Flow Problem 1 The Network Flow Problem 4 a x 3 5 3 7 7 4 s b y t 6 6 1 4 5 c z How much stuff can flow from s to t ? 2 Soviet Rail Network, 1955 Reference: On the history of

889 views • 75 slides

Mining Data that Changes 17 July 2015 Data is Not Static Data is not static New

Mining Data that Changes 17 July 2015 Data is Not Static Data is not static New transactions, new friends, stop following somebody in T witter, But most data mining algorithms assume static data Even a minor change requires

925 views • 44 slides

Dealing with missing values part 2 Applied Multivariate Statistics Spring 2012 Overview

Dealing with missing values part 2 Applied Multivariate Statistics Spring 2012 Overview More on Single Imputation: Shortcomings Multiple Imputation: Accounting for uncertainty Appl. Multivariate Statistics - Spring 2012 2 Single

676 views • 28 slides

W4231: Analysis of Algorithms A Network d 11/3/1999 a 4 2 3 1 4 2 Cuts and Flow s c

W4231: Analysis of Algorithms A Network d 11/3/1999 a 4 2 3 1 4 2 Cuts and Flow s c 8 6 7 t b 4 4 g e 4 COMSW4231, Analysis of Algorithms 1 COMSW4231, Analysis of Algorithms 2 A Flow in the Network A

201 views • 7 slides