ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

493 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,509 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,022 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,248 views

9 years ago

ByteByteGo
Bloom Filters | Algorithms You Should Know #2 | Real-world Examples

Subscribe to our weekly system design newsletter: https://bit.ly/3tfAlYD Checkout our bestselling System Design Interview books: ...

5:40
Bloom Filters | Algorithms You Should Know #2 | Real-world Examples

268,756 views

3 years ago

OCLPhase2
Fleury's algorithm

Video to accompany the open textbook Math in Society (http://www.opentextbookstore.com/mathinsociety/). Part of the ...

2:31
Fleury's algorithm

84,906 views

13 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,693 views

11 years ago

Freya Holmér
The Beauty of Bézier Curves

Bézier curves - how do they do? They're used for animation, text rendering, and all sorts of curved shapes! But how do they ...

24:26
The Beauty of Bézier Curves

2,174,687 views

4 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,345 views

9 years ago

Tom S
The Remarkable BEST-SAT Algorithm

A dive into the remarkable BEST-SAT approximation algorithm. Created as a part of SoME2: ...

10:21
The Remarkable BEST-SAT Algorithm

10,532 views

3 years ago

Tom S
The Art of Linear Programming

A visual-heavy introduction to Linear Programming including basic definitions, solution via the Simplex method, the principle of ...

18:56
The Art of Linear Programming

881,035 views

2 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

Simons Institute for the Theory of Computing
Competitive Analysis of Online Algorithms (Part 1)

Anupam Gupta (Carnegie Mellon University) ...

56:00
Competitive Analysis of Online Algorithms (Part 1)

10,687 views

Streamed 3 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

Simons Institute for the Theory of Computing
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds

Soheil Behnezhad (Northeastern University) ...

1:00:37
Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds

704 views

Streamed 2 years ago

Tom S
Cayley's Formula

A short video about an elegant proof of the number of spanning trees of a complete graph. ------------------ Timetable: 0:00 ...

3:45
Cayley's Formula

19,489 views

4 years ago

Simons Institute for the Theory of Computing
An O(n) time algorithm for finding Hamilton cycles with high probability

12th Innovations in Theoretical Computer Science Conference (ITCS 2021) http://itcs-conf.org/ An O(n) time algorithm for finding ...

23:31
An O(n) time algorithm for finding Hamilton cycles with high probability

459 views

5 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,303 views

9 years ago

InQUBate
Lotus Blossom Brainstorming

A quick introduction to Lotus Blossom Brainstorming.

3:22
Lotus Blossom Brainstorming

138 views

1 year ago

Tom S
The Most Elegant Search Structure | (a,b)-trees

An introduction to (a,b)-trees – definition, operations, usage. ------------------ Timetable: 0:00 - Fever dream? 0:28 - Introduction 2:04 ...

11:38
The Most Elegant Search Structure | (a,b)-trees

44,185 views

2 years ago

Samuel Russell
Hopcroft-Karp Algorithm

Explanation and complexity with example.

9:59
Hopcroft-Karp Algorithm

12,567 views

10 years ago