ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

50 results

Roel Van de Paar
Concept of M-augmenting path to find a larger matching than $M$

Concept of M-augmenting path to find a larger matching than $M$ Helpful? Please support me on Patreon: ...

2:14
Concept of M-augmenting path to find a larger matching than $M$

18 views

4 years ago

Math 3012 at The Georgia Institute of Technology
L24V06

Because you're you're burying an instance of dyra and you want the augmenting path that has the shortest one so if you're ...

3:26
L24V06

328 views

9 years ago

Roel Van de Paar
Computer Science: residual graph and augmenting path in max flow

Computer Science: residual graph and augmenting path in max flow Helpful? Please support me on Patreon: ...

2:12
Computer Science: residual graph and augmenting path in max flow

8 views

4 years ago

Tutor Lynn
Dijkstra's Algorithm in 1 minute

The common variant of Dijkstra's Algorithm, used to find the single-source shortest-path to all nodes. The intended audience of the ...

1:05
Dijkstra's Algorithm in 1 minute

82 views

7 years ago

Roel Van de Paar
Computer Science: Is a matching $M$ maximum iff the graph doesn't have an augmenting path wrt $M$?

Computer Science: Is a matching $M$ maximum iff the graph doesn't have an augmenting path wrt $M$? Helpful? Please support ...

1:32
Computer Science: Is a matching $M$ maximum iff the graph doesn't have an augmenting path wrt $M$?

3 views

4 years ago

Josiah Hartley
Graph Theory Example: Nearest Neighbor Algorithm

This example is taken from Versatile Mathematics, an OER textbook created at Frederick Community College. The book can be ...

1:47
Graph Theory Example: Nearest Neighbor Algorithm

748 views

5 years ago

Roel Van de Paar
Why is it that the flow value can increased along an augmenting path $p$ in a residual network?

Computer Science: Why is it that the flow value can increased along an augmenting path $p$ in a residual network? Helpful?

3:20
Why is it that the flow value can increased along an augmenting path $p$ in a residual network?

0 views

4 years ago

Roel Van de Paar
Computer Science: Citation for finding node disjoint paths using maximum flow

Computer Science: Citation for finding node disjoint paths using maximum flow Helpful? Please support me on Patreon: ...

1:22
Computer Science: Citation for finding node disjoint paths using maximum flow

61 views

4 years ago

Roel Van de Paar
Confused with the proof that Edmonds-Karp always monotically increases the shortest-paths

Confused with the proof that Edmonds-Karp always monotically increases the shortest-paths Helpful? Please support me on ...

2:58
Confused with the proof that Edmonds-Karp always monotically increases the shortest-paths

33 views

4 years ago

Roel Van de Paar
Given all maximal independent sets of a graph, find the maximum indepdent set

Given all maximal independent sets of a graph, find the maximum indepdent set Helpful? Please support me on Patreon: ...

1:32
Given all maximal independent sets of a graph, find the maximum indepdent set

71 views

4 years ago

Roel Van de Paar
Computer Science: Maximum flow with Edmonds Karp algorithm

Computer Science: Maximum flow with Edmonds Karp algorithm Helpful? Please support me on Patreon: ...

2:01
Computer Science: Maximum flow with Edmonds Karp algorithm

42 views

4 years ago

Roel Van de Paar
weight constrained shortest path problem variants

weight constrained shortest path problem variants Helpful? Please support me on Patreon: ...

2:14
weight constrained shortest path problem variants

102 views

4 years ago

Roel Van de Paar
Computer Science: Bounded Integer Edge Weights, Dijkstra's Algorithm

Computer Science: Bounded Integer Edge Weights, Dijkstra's Algorithm Helpful? Please support me on Patreon: ...

1:21
Computer Science: Bounded Integer Edge Weights, Dijkstra's Algorithm

14 views

4 years ago

Roel Van de Paar
Computer Science: How does the slow All-pairs-shortest-paths algorithm work?

Computer Science: How does the slow All-pairs-shortest-paths algorithm work? Helpful? Please support me on Patreon: ...

2:45
Computer Science: How does the slow All-pairs-shortest-paths algorithm work?

54 views

4 years ago

Roel Van de Paar
Software Engineering: Augmenting functionality of subclasses without code duplication in C++

Software Engineering: Augmenting functionality of subclasses without code duplication in C++ Helpful? Please support me on ...

2:29
Software Engineering: Augmenting functionality of subclasses without code duplication in C++

1 view

3 years ago

Roel Van de Paar
Computer Science: Maximum weight matching (2 Solutions!!)

Computer Science: Maximum weight matching Helpful? Please support me on Patreon: https://www.patreon.com/roelvandepaar ...

1:40
Computer Science: Maximum weight matching (2 Solutions!!)

58 views

4 years ago

Roel Van de Paar
Solving the min edge cover using the maximum matching algorithm (3 Solutions!!)

Solving the min edge cover using the maximum matching algorithm Helpful? Please support me on Patreon: ...

2:59
Solving the min edge cover using the maximum matching algorithm (3 Solutions!!)

87 views

4 years ago

Roel Van de Paar
Computer Science: On the analysis of Christofides's algorithm

Computer Science: On the analysis of Christofides's algorithm Helpful? Please support me on Patreon: ...

1:35
Computer Science: On the analysis of Christofides's algorithm

149 views

4 years ago

Roel Van de Paar
Karger's min cut algorithm

Karger's min cut algorithm Helpful? Please support me on Patreon: https://www.patreon.com/roelvandepaar With thanks & praise ...

2:19
Karger's min cut algorithm

107 views

3 years ago

Roel Van de Paar
Maximum matching in a bipartite graph

Maximum matching in a bipartite graph Helpful? Please support me on Patreon: https://www.patreon.com/roelvandepaar With ...

1:40
Maximum matching in a bipartite graph

14 views

4 years ago