ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

26 results

Udacity
Analysis of Dinic's Algorithm - GT - Computability, Complexity, Theory: Algorithms

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3523558599/m-1062728578 Check out the full Advanced ...

2:29
Analysis of Dinic's Algorithm - GT - Computability, Complexity, Theory: Algorithms

17,266 views

10 years ago

Udacity
Dinic's Algorithm - Georgia Tech - Computability, Complexity, Theory: Algorithms

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3523558599/m-1062728577 Check out the full Advanced ...

1:47
Dinic's Algorithm - Georgia Tech - Computability, Complexity, Theory: Algorithms

11,155 views

10 years ago

Tushar Roy - Coding Made Simple
Ford Fulkerson Algorithm Edmonds Karp Algorithm For Max Flow

https://www.facebook.com/tusharroy25 ...

38:01
Ford Fulkerson Algorithm Edmonds Karp Algorithm For Max Flow

188,236 views

10 years ago

NPTEL-NOC IITM
mod08lec44 - Ford-Fulkerson for MaxFlow

... for Dinic's algorithm here: https://github.com/noc21-cs99/lectures/blob/main/Week08/Mod1b-maxflow-dinic.cpp Other sources to ...

25:05
mod08lec44 - Ford-Fulkerson for MaxFlow

4,689 views

4 years ago

NPTEL-NOC IITM
mod08lec43 - Introduction to MaxFlow

... for Dinic's algorithm here: https://github.com/noc21-cs99/lectures/blob/main/Week08/Mod1b-maxflow-dinic.cpp Other sources to ...

21:00
mod08lec43 - Introduction to MaxFlow

4,649 views

4 years ago

NPTEL-NOC IITM
mod08lec45 - Implementing Edmonds-Karp

... for Dinic's algorithm here: https://github.com/noc21-cs99/lectures/blob/main/Week08/Mod1b-maxflow-dinic.cpp Other sources to ...

25:19
mod08lec45 - Implementing Edmonds-Karp

3,651 views

4 years ago

Udacity
The Edmonds-Karp Algorithm - GT - Computability, Complexity, Theory: Algorithms

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3523558599/m-1062728575 Check out the full Advanced ...

0:49
The Edmonds-Karp Algorithm - GT - Computability, Complexity, Theory: Algorithms

6,435 views

10 years ago

Veritasium and fern
The Obviously True Theorem No One Can Prove

This deceptively simple math problem has stumped mathematicians for almost 300 years! Head to ...

42:34
The Obviously True Theorem No One Can Prove

8,007,244 views

6 months ago

Digital Futures: Research Hub for Digitalization
Danupon Na Nongai - New Perspectives on Classic Questions in the Theory of Graph Algorithms

The theory of graph algorithms is a research field that develops clever mathematical techniques with provable guarantees to ...

56:32
Danupon Na Nongai - New Perspectives on Classic Questions in the Theory of Graph Algorithms

98 views

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

3 years ago

Rutgers University
DIMACS Networking Workshop: Introductory Remarks

Thyagarajan Nandagopal (NSF AiTF), Vyas Sekar, and Michael Dinitz provide some opening remarks for the DIMACS Workshop ...

15:25
DIMACS Networking Workshop: Introductory Remarks

592 views

9 years ago

Simons Institute for the Theory of Computing
When Is the Convergence Time of Langevin Algorithms Dimension Independent: ...

Yian Ma (UC San Diego) ...

32:21
When Is the Convergence Time of Langevin Algorithms Dimension Independent: ...

501 views

Streamed 4 years ago

Simons Institute for the Theory of Computing
Locally Testable Codes with Constant Rate, Distance, and Locality

Irit Dinur (Weizmann Institute of Science) ...

1:06:40
Locally Testable Codes with Constant Rate, Distance, and Locality

4,705 views

Streamed 4 years ago

Udacity
The Max-Flow Min-Cut Theorem - GT- Computability, Complexity, Theory: Algorithms

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud061/l-3523558599/m-1037198834 Check out the full Advanced ...

1:44
The Max-Flow Min-Cut Theorem - GT- Computability, Complexity, Theory: Algorithms

12,313 views

10 years ago

Simons Institute for the Theory of Computing
Vertex Fault-Tolerant Emulators

13th Innovations in Theoretical Computer Science Conference (ITCS 2022) http://itcs-conf.org/ Vertex Fault-Tolerant Emulators ...

30:05
Vertex Fault-Tolerant Emulators

101 views

3 years ago

Simons Institute for the Theory of Computing
ITCS 2022 Session 17

Chair: Nicole Wein A Unifying Framework for Characterizing and Computing Width Measures Eduard Eiben (Royal Holloway, ...

1:07:55
ITCS 2022 Session 17

259 views

Streamed 3 years ago

Simons Institute for the Theory of Computing
Epic Fail: Emulators can tolerate some edge faults for free

Authors: Greg Bodwin (University of Michigan); Michael Dinitz (Johns Hopkins University); Yasamin Nazari (University of ...

27:55
Epic Fail: Emulators can tolerate some edge faults for free

126 views

3 years ago

Algorithms Lab
CCCG 2020: Restricted-Weight Minimum-Dilation Spanners on Three Points

Digital presentation for the 32nd Canadian Conference on Computational Geometry for the paper "Restricted-Weight ...

16:11
CCCG 2020: Restricted-Weight Minimum-Dilation Spanners on Three Points

345 views

5 years ago

ICALP 2021
A5C.1 Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems

A5C.1 Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems Adam Karczmarz.

19:11
A5C.1 Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems

110 views

4 years ago

Simons Institute for the Theory of Computing
Proofs and Circuits: Connections via Interpolation and Lifting

Susanna de Rezende (Czech Academy of Sciences) https://simons.berkeley.edu/talks/tbd-286 50 Years of Satisfiability: The ...

51:20
Proofs and Circuits: Connections via Interpolation and Lifting

468 views

Streamed 4 years ago