ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

6 results

TCS+
TCS+ Talk: Julia Chuzoy (TTIC)

Title: Faster Combinatorial Algorithms for Bipartite Matching Abstract: Maximum bipartite matching is among the most fundamental ...

46:42
TCS+ Talk: Julia Chuzoy (TTIC)

103 views

2 weeks ago

The Code Bit
Edmonds' Blossom Algorithm - 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
Edmonds' Blossom Algorithm - Blossoms That Unlock Perfect Pairings

48 views

4 weeks ago

K11 Tech University
Maximum Flow: Throughput and Constraints in Netwoked Systems

The Max Flow Problem: Unlike shortest-path algorithms, flow algorithms focus on maximum throughput. We examine why the ...

7:20
Maximum Flow: Throughput and Constraints in Netwoked Systems

6 views

8 days ago

Sagar Choudhary
Maximum Flow Problem Explained | Ford–Fulkerson Algorithm with Example | DAA

📘 Welcome to the Graph Algorithms section of the DAA Playlist! In this video, we explain the Maximum Flow Problem using the ...

16:39
Maximum Flow Problem Explained | Ford–Fulkerson Algorithm with Example | DAA

410 views

3 weeks ago

K11 Tech University
Bipartite Matching and the Art of Fair Allocation

Bipartite Matching & Assignments: Who Gets What — Without Conflict In this episode, we reframe matching from a "special graph ...

6:28
Bipartite Matching and the Art of Fair Allocation

0 views

8 days ago

UiPath
How agentic orchestration enables ROI at enterprise scale

UiPath Maestro: Where agentic automation meets seamless orchestration: https://uipath.ly/49PVzlo Agentic automation creates ...

14:00
How agentic orchestration enables ROI at enterprise scale

740 views

3 days ago