ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

123 results

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

52,567 views

4 years ago

Advanced Graph Theory - IITK
Lecture 12: Matching in General Graphs: Edmonds’ Blossom Algorithm

In this lecture, we will discuss the Matchings in General Graphs i.e. Edmonds' Blossom Algorithm.

26:00
Lecture 12: Matching in General Graphs: Edmonds’ Blossom Algorithm

18,029 views

7 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,300 views

9 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

16,816 views

3 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,081 views

10 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,152,057 views

10 years ago

Udacity
Computing a Maximal Matching

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

2:31
Computing a Maximal Matching

26,347 views

9 years ago

nptelhrd
Mod-01 Lec-07 Edmond\\\'s Matching Algo I

Computer Algorithms - 2 by Prof. Shashank K. Mehta,Department of Computer Science and Engineering,IIT Kanpur.For more ...

52:13
Mod-01 Lec-07 Edmond\\\'s Matching Algo I

12,694 views

11 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

42,880 views

9 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,332 views

9 years ago

Udacity
Switching Algorithm: Maximal Matching - Georgia Tech - Network Implementation

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud436/l-1725188650/m-671649071 Check out the full Computer ...

2:17
Switching Algorithm: Maximal Matching - Georgia Tech - Network Implementation

4,791 views

10 years ago

nptelhrd
Mod-01 Lec-08 Edmond\'s Matching Algo II

Computer Algorithms - 2 by Prof. Shashank K. Mehta,Department of Computer Science and Engineering,IIT Kanpur.For more ...

43:47
Mod-01 Lec-08 Edmond\'s Matching Algo II

4,547 views

11 years ago

MIT OpenCourseWare
R7. Network Flow and Matching

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

51:12
R7. Network Flow and Matching

39,504 views

9 years ago

Udacity
Reduction to Max Flow - Georgia Tech - Computability, Complexity, Theory: Algorithms

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

1:55
Reduction to Max Flow - Georgia Tech - Computability, Complexity, Theory: Algorithms

7,064 views

10 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,317 views

9 years ago

Udacity
The Edmonds-Karp Algorithm - GT - Computability, Complexity, Theory: Algorithms

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

0:49
The Edmonds-Karp Algorithm - GT - Computability, Complexity, Theory: Algorithms

6,444 views

10 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,304 views

10 years ago

freeCodeCamp.org
Algorithms Course - Graph Theory Tutorial from a Google Engineer

This full course provides a complete introduction to Graph Theory algorithms in computer science. Knowledge of how to create ...

6:44:40
Algorithms Course - Graph Theory Tutorial from a Google Engineer

1,813,719 views

6 years ago

Samuel Russell
Hopcroft-Karp Algorithm

Explanation and complexity with example.

9:59
Hopcroft-Karp Algorithm

12,573 views

10 years ago

Simons Institute for the Theory of Computing
Beating the Folklore Algorithm for Dynamic Matching

13th Innovations in Theoretical Computer Science Conference (ITCS 2022) http://itcs-conf.org/ Beating the Folklore Algorithm for ...

22:39
Beating the Folklore Algorithm for Dynamic Matching

292 views

3 years ago