ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

79 results

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,151,297 views

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

3 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

52,530 views

4 years ago

Computational Thinking
Network Flows and the Ford-Fulkersson Algorithm

We discuss an algorithm based on linear programs, and also the Ford-Fulkersson augmenting paths algorithm.

11:50
Network Flows and the Ford-Fulkersson Algorithm

994 views

3 years ago

Geekific
Max Flow | Ford-Fulkerson Algorithm Explained and Implemented in Java | Graph Theory | Geekific

Discord Community: https://discord.gg/dK6cB24ATp GitHub Repository: https://github.com/geekific-official/ The subject of this ...

8:23
Max Flow | Ford-Fulkerson Algorithm Explained and Implemented in Java | Graph Theory | Geekific

7,202 views

3 years ago

OptWhiz
How do you optimally bomb the Soviet rail network? | Max Flow (Ford-Fulkerson)

The maximum flow problem originated from the US Air Force during the Cold War. The US military at the time wanted to ...

14:06
How do you optimally bomb the Soviet rail network? | Max Flow (Ford-Fulkerson)

3,007 views

3 years ago

Computational Thinking
Flows outdated

We discuss an algorithm based on linear programs, and also the Ford-Fulkersson augmenting paths algorithm.

11:50
Flows outdated

192 views

3 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

814 views

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

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

8 years ago

Michel Bierlaire
Network: paths

Bierlaire (2015) Optimization: principles and algorithms, EPFL Press. Section 21.3.

4:18
Network: paths

1,026 views

7 years ago

Erik Jenner
Extensions of Karger's Algorithm | ICCV 2021 Oral

Presentation for the ICCV paper "Extensions of Karger's Algorithm: Why They Fail in Theory And How They Are Useful in Practice" ...

10:27
Extensions of Karger's Algorithm | ICCV 2021 Oral

217 views

4 years ago

industrialinformatics
Combinatorial Optimization - Lab 09: Initial feasible flow for Ford-Fulkerson's algorithm

This video explains, how to find an initial feasible flow for Ford-Fulkerson's algorithm in general networks with non-zero lower ...

9:09
Combinatorial Optimization - Lab 09: Initial feasible flow for Ford-Fulkerson's algorithm

2,790 views

5 years ago

MIT OpenCourseWare
2.10.1 Trees: Video

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

8:07
2.10.1 Trees: Video

5,348 views

9 years ago

Recherche Opérationnelle
Couplage Maximum dans un graphe biparti (Maximum matching in a bipartite graph)

Cette vidéo présente l'algorithme "de Berge" basé sur les chaînes augmentantes pour le problème de couplage maximum dans ...

16:12
Couplage Maximum dans un graphe biparti (Maximum matching in a bipartite graph)

8,519 views

4 years ago

Udacity
How to Find the Shortest 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.

4:53
How to Find the Shortest Path - Intro to Algorithms

12,441 views

10 years ago

DeepLearningAI
C4W2L03 Resnets

Take the Deep Learning Specialization: http://bit.ly/2vKdud0 Check out all our courses: https://www.deeplearning.ai Subscribe to ...

7:08
C4W2L03 Resnets

205,542 views

8 years ago

MIT OpenCourseWare
2.11.9 Hall's Theorem

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

15:31
2.11.9 Hall's Theorem

39,594 views

9 years ago

Gate Smashers
Lec-58: Introduction to AVL Tree in Data Structure with Examples | All Imp Points of AVL

Subscribe to our new channel:https://www.youtube.com/@varunainashots 0:00 - Introduction 0:56 -Order for data insertion in ...

9:54
Lec-58: Introduction to AVL Tree in Data Structure with Examples | All Imp Points of AVL

1,521,925 views

5 years ago

wenxing liu
ICRA 2023: Sim-and-Real Reinforcement Learning for Manipulation: A Consensus-based Approach

This video summarises and supplements the ICRA 2023 accepted paper "Sim-and-Real Reinforcement Learning for ...

4:22
ICRA 2023: Sim-and-Real Reinforcement Learning for Manipulation: A Consensus-based Approach

404 views

2 years ago