ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

219 results

Udacity
Maximal and Maximum Matchings

This video is part of the Udacity course "High Performance Computing". Watch the full course at ...

1:26
Maximal and Maximum Matchings

57,806 views

9 years ago

Wolfram Demonstrations Project
The Blossom Algorithm for Maximum Matching

http://demonstrations.wolfram.com/TheBlossomAlgorithmForMaximumMatching The Wolfram Demonstrations Project contains ...

0:13
The Blossom Algorithm for Maximum Matching

8,383 views

14 years ago

Udacity
Analysis of Edmonds-Karp - Georgia Tech - Computability, Complexity, Theory: Algorithms

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

2:28
Analysis of Edmonds-Karp - Georgia Tech - Computability, Complexity, Theory: Algorithms

30,611 views

10 years ago

Wolfram Demonstrations Project
The Blossom Algorithm for Weighted Graphs

http://demonstrations.wolfram.com/TheBlossomAlgorithmForWeightedGraphs The Wolfram Demonstrations Project contains ...

0:25
The Blossom Algorithm for Weighted Graphs

1,133 views

12 years ago

MIT OpenCourseWare
Assignment 8: (Knit, Woven, Embroidery, or Print) - Blossom algorithm animation

MIT MAS.962 Special Topics: New Textiles, Spring 2010 Instructor: Rizal Muslimin View the complete course: ...

0:58
Assignment 8: (Knit, Woven, Embroidery, or Print) - Blossom algorithm animation

2,802 views

12 years ago

Wolfram Demonstrations Project
The Blossom Algorithm for Maximum Matching

http://demonstrations.wolfram.com/TheBlossomAlgorithmForMaximumMatching The Wolfram Demonstrations Project contains ...

0:13
The Blossom Algorithm for Maximum Matching

3,744 views

13 years ago

jfigueroa789
Computing minimum-weight perfect matching by linear programming.

Start by modeling the LP problem as in the bipartite case and solving it. - If the subgraph induced by the found solution has odd ...

0:05
Computing minimum-weight perfect matching by linear programming.

802 views

4 years ago

Wolfram Demonstrations Project
The Blossom Algorithm for Weighted Graphs

http://demonstrations.wolfram.com/TheBlossomAlgorithmForWeightedGraphs The Wolfram Demonstrations Project contains ...

0:25
The Blossom Algorithm for Weighted Graphs

2,217 views

13 years ago

Mr. Scuruchi
9   Flow   Maximum Flow   Minimum cut
2:24
9 Flow Maximum Flow Minimum cut

42,164 views

3 years ago

Bill Cook
blossom20

Concorde TSP app running Edmonds' blossom algorithm for perfect matchings.

3:30
blossom20

869 views

11 years ago

David Sturgill
Maximum Matching via the Edmonds-Karp Algorithm for Network Flow

Here, we're seeing how a network flow solution can be applied to solve the maximum matching problem in a bipartite graph.

3:39
Maximum Matching via the Edmonds-Karp Algorithm for Network Flow

1,713 views

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

10 years ago

Udacity
Switching Algorithm: Maximal Matching - Georgia Tech - Network Implementation

Watch on Udacity: https://www.udacity.com/course/viewer#!/c-ud436/l-1725188650/m-671649071 Check out the full Computer ...

2:17
Switching Algorithm: Maximal Matching - Georgia Tech - Network Implementation

4,777 views

10 years ago

Udacity
Computing a Maximal Matching

This video is part of the Udacity course "High Performance Computing". Watch the full course at ...

2:31
Computing a Maximal Matching

26,315 views

9 years ago

WikiAudio
Jack Edmonds

If you find our videos helpful you can support us by buying something from amazon. https://www.amazon.com/?tag=wiki-audio-20 ...

3:52
Jack Edmonds

167 views

9 years ago

Udacity
Reduction to Max Flow - Georgia Tech - Computability, Complexity, Theory: Algorithms

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

1:55
Reduction to Max Flow - Georgia Tech - Computability, Complexity, Theory: Algorithms

7,054 views

10 years ago

Joshua J. Daymude
CSE 550 (2022, Fall): 3.7 The Maximum-Cardinality-Matching Problem

Part 7 of Lecture 3: Network Flows and Matchings. This short lecture defines the Maximum-Cardinality-Matching problem.

3:26
CSE 550 (2022, Fall): 3.7 The Maximum-Cardinality-Matching Problem

1,596 views

3 years ago

Lex Clips
Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman

Full episode with Richard Karp (Jul 2020): https://www.youtube.com/watch?v=KllCrlfLuzs Clips channel (Lex Clips): ...

2:50
Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman

63,321 views

5 years ago

Udacity
Reduction Correctness - Georgia Tech - Computability, Complexity, Theory: Algorithms

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

1:46
Reduction Correctness - Georgia Tech - Computability, Complexity, Theory: Algorithms

1,333 views

10 years ago

Lex Clips
Visualizing an Algorithm | Richard Karp and Lex Fridman

Full episode with Richard Karp (Jul 2020): https://www.youtube.com/watch?v=KllCrlfLuzs Clips channel (Lex Clips): ...

3:36
Visualizing an Algorithm | Richard Karp and Lex Fridman

2,419 views

5 years ago