ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

232 results

Udacity
Augmenting Paths - Georgia Tech - Computability, Complexity, Theory: Algorithms

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3527768539/m-1929898656 Check out the full Advanced ...

3:38
Augmenting Paths - Georgia Tech - Computability, Complexity, Theory: Algorithms

70,359 views

11 years ago

Michael Sambol
Ford-Fulkerson in 5 minutes

Step by step instructions showing how to run Ford-Fulkerson on a flow network.

5:15
Ford-Fulkerson in 5 minutes

1,162,008 views

10 years ago

Tom S
The Blossom Algorithm

An overview of the Blossom algorithm for maximum graph matching. ------------------ Timetable: 0:00 - Introduction 0:41 - Definitions ...

6:09
The Blossom Algorithm

53,312 views

4 years ago

OptWhiz
Can we assign everyone a job? (maximum matchings) | Bipartite Matchings

Matching problems are ubiquitous in real life, like matching students to schools, drivers to passengers, airplanes to airports, etc.

10:20
Can we assign everyone a job? (maximum matchings) | Bipartite Matchings

17,316 views

3 years ago

Udacity
Residual Networks - Georgia Tech - Computability, Complexity, Theory: Algorithms

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3523558599/m-1037198819 Check out the full Advanced ...

2:41
Residual Networks - Georgia Tech - Computability, Complexity, Theory: Algorithms

70,298 views

11 years ago

Graph Theory
Augmenting Path Algorithm

Augmenting Path Algorithm Prof. Soumen Maity Department Of Mathematics IISER Pune.

28:36
Augmenting Path Algorithm

24,326 views

8 years ago

Udacity
Analysis of Edmonds-Karp - Georgia Tech - Computability, Complexity, Theory: Algorithms

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3523558599/m-1062728576 Check out the full Advanced ...

2:28
Analysis of Edmonds-Karp - Georgia Tech - Computability, Complexity, Theory: Algorithms

31,917 views

11 years ago

Udacity
Maximal and Maximum Matchings

This video is part of the Udacity course "High Performance Computing". Watch the full course at ...

1:26
Maximal and Maximum Matchings

58,858 views

9 years ago

Graph Theory
Residual Network and Augmenting Path

Residual Network and Augmenting Path Prof. Soumen Maity Department Of Mathematics IISER Pune.

32:24
Residual Network and Augmenting Path

22,429 views

8 years ago

MIT OpenCourseWare
13. Incremental Improvement: Max Flow, Min Cut

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:22:58
13. Incremental Improvement: Max Flow, Min Cut

168,916 views

9 years ago

Tushar Roy - Coding Made Simple
Ford Fulkerson Algorithm Edmonds Karp Algorithm For Max Flow

https://www.facebook.com/tusharroy25 ...

38:01
Ford Fulkerson Algorithm Edmonds Karp Algorithm For Max Flow

188,970 views

10 years ago

MIT OpenCourseWare
Lecture 15: Single-Source Shortest Paths Problem

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Srini Devadas ...

53:15
Lecture 15: Single-Source Shortest Paths Problem

258,233 views

13 years ago

Udacity
Shortest Augmenting Paths - GT - Computability, Complexity, Theory: Algorithms

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3527768539/m-1052679069 Check out the full Advanced ...

2:46
Shortest Augmenting Paths - GT - Computability, Complexity, Theory: Algorithms

6,309 views

11 years ago

Udacity
Flow Networks - Georgia Tech - Computability, Complexity, Theory: Algorithms

Check out the full Advanced Operating Systems course for free at: https://www.udacity.com/course/ud061 Georgia Tech online ...

2:16
Flow Networks - Georgia Tech - Computability, Complexity, Theory: Algorithms

55,772 views

11 years ago

Yong Wang
Operations Research 08G: Maximum Flow Problem & Ford Fulkerson Method

Textbooks: https://amzn.to/2VgimyJ https://amzn.to/2CHalvx https://amzn.to/2Svk11k In this video, I'll talk about how to solve the ...

5:14
Operations Research 08G: Maximum Flow Problem & Ford Fulkerson Method

39,950 views

8 years ago

MIT OpenCourseWare
2.11.7 Bipartite Matching

MIT 6.042J Mathematics for Computer Science, Spring 2015 View the complete course: http://ocw.mit.edu/6-042JS15 Instructor: ...

4:02
2.11.7 Bipartite Matching

43,059 views

9 years ago

Simons Institute for the Theory of Computing
A Theory of Alternating Paths and Blossoms, from the Perspective of Minimum Length pt.2

Vijay V. Vazirani (University of California, Irvine) ...

57:06
A Theory of Alternating Paths and Blossoms, from the Perspective of Minimum Length pt.2

667 views

Streamed 2 years ago

MIT OpenCourseWare
14. Incremental Improvement: Matching

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:22:32
14. Incremental Improvement: Matching

58,529 views

9 years ago

CSU Mathematics
Matchings on graphs

We discuss matchings, Hall's theorem, and their applications. Course: Math 301 at Colorado State University Lecturer: Maria ...

12:03
Matchings on graphs

839 views

4 years ago

Udacity
Longest Simple Path - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

2:04
Longest Simple Path - Intro to Algorithms

34,264 views

11 years ago