ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

86 results

Graph Garden
Maximum Matching in General Graphs: Edmonds' Blossom Algorithm — Visualized in 12 Minutes

How do you find a maximum matching in a graph that is not bipartite? Odd cycles break the classic augmenting-path search.

11:41
Maximum Matching in General Graphs: Edmonds' Blossom Algorithm — Visualized in 12 Minutes

1,392 views

3mo ago

The Code Bit
BEST Edmonds' Blossom Algorithm EXPLAINER  - Blossoms That Unlock Perfect Pairings

Blossoms That Unlock Perfect Pairings – Edmonds' Blossom Algorithm Explained If you have ever tried to pair things up in the ...

6:18
BEST Edmonds' Blossom Algorithm EXPLAINER - Blossoms That Unlock Perfect Pairings

1,244 views

10mo ago

Dayi Fan
02-Massively Parallel Framework of Graph Maximum Matching

X-Blossom is the first large-scale parallel computation framework for maximum matching in general graphs. It proposes a new ...

13:53
02-Massively Parallel Framework of Graph Maximum Matching

97 views

2mo ago

CoreCSE
Maximum Flow in Network- Edmond Karp Algorithm

Bubble Sort: https://youtu.be/F_yQ90ieAY0 insertion sort: https://youtu.be/uP11mxLyEOY selection sort: ...

15:54
Maximum Flow in Network- Edmond Karp Algorithm

2,706 views

4mo ago

Blossom Social
The New Blossom Algorithm Explained!

We've heard your feedback and have been working hard over the past months to significantly update the Blossom algorithm and ...

54:00
The New Blossom Algorithm Explained!

990 views

Streamed 1mo ago

Web Fusion with Bharadwaj
4. Edmonds' Blossom Algorithm (Java)

DSA, System Design, LeetCode, Codeforces & Advanced Algorithms, Explained in Detail Deep, clear, intuition-first coding ...

1:11:22
4. Edmonds' Blossom Algorithm (Java)

200 views

7mo ago

AI Proved What?
Maximum Matching in Almost-Linear Time? An AI Claims to Beat Micali–Vazirani

Result 120 in OpenAI's math release claims an almost-linear-time algorithm for maximum matching in general graphs. A matching ...

5:24
Maximum Matching in Almost-Linear Time? An AI Claims to Beat Micali–Vazirani

0 views

15h ago

David Karger's Lectures
6 5220 Lecture 13: Fingerprinting by polynomials, perfect matching, network coding.

... not parallelize and this does and we'll look at that next week um any questions about this uh bipartite matching algorithm uh yes.

1:33:00
6 5220 Lecture 13: Fingerprinting by polynomials, perfect matching, network coding.

104 views

11mo ago

NECSTLab
NFT @ 13022026: Rock the QASBA

This work presents QASBA, an FPGA-based hardware accelerator for the Sparse Blossom Algorithm (SBA), a state-of-the-art ...

40:48
NFT @ 13022026: Rock the QASBA

26 views

8mo ago

The Modern SDE
Maximum Bipartite Matching Using Max Flow (Ford-Fulkerson) Explained in Java | DSA Course L130

Lecture 130 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Matchings, matched ...

9:24
Maximum Bipartite Matching Using Max Flow (Ford-Fulkerson) Explained in Java | DSA Course L130

14 views

3w ago

コンピュータを科学する | 東大理情五月祭企画
【第99回五月祭LT】「Blossom Algorithm ~最高難度の組み合わせ論的アルゴリズム~」

東京大学理学部情報科学科の学生が第99回五月祭の学科企画「コンピュータを科学する」にて実施するLTです。

18:31
【第99回五月祭LT】「Blossom Algorithm ~最高難度の組み合わせ論的アルゴリズム~」

154 views

Streamed 5mo ago

FGF
Everything About Graph Theory, Explained Slowly For Sleep

Tired of racing thoughts and endless to-do lists keeping you up at night? Let the logical, orderly structure of graph theory guide ...

1:28:46
Everything About Graph Theory, Explained Slowly For Sleep

33 views

4mo ago

Trice of Life™
Algorithms of Network Flow

Algorithms of Network Flow Network flow models the movement of resources through directed pathways from a source node to a ...

9:09
Algorithms of Network Flow

5 views

3w ago

Peak time Learners
Bipartite Graph and Bipartite matching | DAA | KTU MCA S3 | Mod 4 part 11 | Malayalam

Six matching. Algorithm. Important after exam okay any part matching applications job assignment problem college admission or ...

4:26
Bipartite Graph and Bipartite matching | DAA | KTU MCA S3 | Mod 4 part 11 | Malayalam

1,207 views

11mo ago

Sudhakar Atchala
Ford-Fulkerson's (Fluckerson) Algorithm in DAA || Maximum Flow Problem || Flow Networks

1. Compiler Design Playlist: https://www.youtube.com/playlist?list=PLXj4XH7LcRfC9pGMWuM6UWE3V4YZ9TZzM ...

22:08
Ford-Fulkerson's (Fluckerson) Algorithm in DAA || Maximum Flow Problem || Flow Networks

19,326 views

6mo ago

The Code Bit
BEST HOPCROFT Karp Algorithm EXPLAINER - Fast Matching Algorithm

Fast Pairing at Scale – Hopcroft–Karp Algorithm Explained (Bipartite Matching) For YouTube viewers, here's the core idea upfront: ...

6:08
BEST HOPCROFT Karp Algorithm EXPLAINER - Fast Matching Algorithm

379 views

10mo ago

CoreCSE
Network Maximum -  Ford Fulkerson Algorithm

Bubble Sort: https://youtu.be/F_yQ90ieAY0 insertion sort: https://youtu.be/uP11mxLyEOY selection sort: ...

10:38
Network Maximum - Ford Fulkerson Algorithm

67 views

4mo 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

3mo ago

Binary Verse AI
Maximum Cardinality Matching: How the OpenAI Proof Breaks the √n Barrier

Read the full article: https://binaryverseai.com/maximum-cardinality-matching-openai-proof/ Maximum cardinality matching asks a ...

16:14
Maximum Cardinality Matching: How the OpenAI Proof Breaks the √n Barrier

1,026 views

7d ago