Maximum flow problem

Results: 146



#Item
1CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-01-22 08:04:42
2usinggraphcuts_in_gpus_for_color_based_human_skin_segmentation_revision

usinggraphcuts_in_gpus_for_color_based_human_skin_segmentation_revision

Add to Reading List

Source URL: www.gcg.ufjf.br

Language: English - Date: 2016-07-25 19:25:40
3.  CS711008Z Algorithm Design and Analysis .  Lecture 8. Algorithm design technique: Linear programming

. CS711008Z Algorithm Design and Analysis . Lecture 8. Algorithm design technique: Linear programming

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2015-12-15 05:30:55
4Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-17 15:32:23
5Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-09-21 15:30:39
6Algorithms and Data Structures Winter TermExercises for UnitIn a basketball tournament n teams play against each other (possibly multiple times) in a pre-determined sequence. The winner of a game gets one

Algorithms and Data Structures Winter TermExercises for UnitIn a basketball tournament n teams play against each other (possibly multiple times) in a pre-determined sequence. The winner of a game gets one

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-20 15:51:01
7CPSCECON, Fall 2011 Solution Set for Exam 2 Question 1: (a) Let G = (V, E, t) be a trust graph, as the term is defined in Section 27.5, and let v0 be a distinguished “start node.” See “Definitio

CPSCECON, Fall 2011 Solution Set for Exam 2 Question 1: (a) Let G = (V, E, t) be a trust graph, as the term is defined in Section 27.5, and let v0 be a distinguished “start node.” See “Definitio

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2011-12-22 14:05:18
8Single Source Multiroute Flows and Cuts on Uniform Capacity Networks∗ Henning Bruhn† ˇ y‡ Jakub Cern´

Single Source Multiroute Flows and Cuts on Uniform Capacity Networks∗ Henning Bruhn† ˇ y‡ Jakub Cern´

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2008-03-13 06:46:48
9CS264: Beyond Worst-Case Analysis Lecture #8: Exact Recovery in Stable Cut Instances∗ Tim Roughgarden† October 15,

CS264: Beyond Worst-Case Analysis Lecture #8: Exact Recovery in Stable Cut Instances∗ Tim Roughgarden† October 15,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-05 01:13:23
10Proceedings of the 15th International Symposium on Advances in Geographic Information Systems ACM GIS 2007 T ERRA S TREAM: From Elevation Data to Watershed Hierarchies∗ Andrew Danner

Proceedings of the 15th International Symposium on Advances in Geographic Information Systems ACM GIS 2007 T ERRA S TREAM: From Elevation Data to Watershed Hierarchies∗ Andrew Danner

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2015-07-24 06:57:56