ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

6 results

Graph Garden
Maximum Bipartite Matching: The Hungarian Algorithm — Visualized in 8 Minutes

In this video, we visualize: - A maximal matching that is not maximum - Berge's theorem, and flipping an augmenting path - The ...

7:37
Maximum Bipartite Matching: The Hungarian Algorithm — Visualized in 8 Minutes

3 views

2 days ago

Graph Garden
Graph Matchings: Berge's Theorem & Tutte's Theorem — Visualized in 5 Minutes

This video builds up matchings from the definition, proves Berge's theorem via augmenting paths, and ends with the full statement ...

5:17
Graph Matchings: Berge's Theorem & Tutte's Theorem — Visualized in 5 Minutes

23 views

2 weeks ago

hmz obi
The Most Confusing Graph Algorithm Explained! | Network Flow from Scratch | Algorithms #10

In this video, we continue our journey through The Algorithm Design Manual by Steven Skiena. This lecture explains one of the ...

21:52
The Most Confusing Graph Algorithm Explained! | Network Flow from Scratch | Algorithms #10

14 views

6 days ago

João Sarubbi
Maximum Flow Problem - Part 3 - Ford-Fulkerson Algorithm
10:25
Maximum Flow Problem - Part 3 - Ford-Fulkerson Algorithm

0 views

0

Mohsen Mirkhalaf
Test-time data augmentation for deep-learning modelling of composites

This short video gives a brief overview of our paper on test-time data augmentation approach for modelling path-dependent ...

9:07
Test-time data augmentation for deep-learning modelling of composites

8 views

12 days ago

Alpha-Code
CSES Speedrun - Graphs - Part V

This is part 5 of me doing problems from the CSES problem set dealing with graphs. Here we tackle some of the heavier graph ...

1:12:43
CSES Speedrun - Graphs - Part V

115 views

3 weeks ago