Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Maximum cardinality matching

Related lectures (27)

Linear Programming Duality

Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.

Greedy Change-Making Algorithm: Optimality and Stability

Explores the optimality of the greedy change-making algorithm and the stability of maximum matching.

Unweighted Bipartite Matching

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Matroids: Matroid Intersection

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

Graph Algorithms: Ford-Fulkerson and Strongly Connected Components

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Algorithms: Union Find and Minimum Spanning Trees

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Algorithms: Stable Matchings

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Spin Model Exercises

Covers exercises on the spin model, independent set, matching, and increasing functions.

Algorithms: Stable Matchings

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Ford-Fulkerson Method: Disjoint-set Data Structures

Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.

Maximum Flow: Theory and Applications

Explores maximum flow in graphs, covering Ford-Fulkerson algorithm, flow conservation, and minimum cut.

Max-flow Min-cut Theorem

Explores the equivalence between maximum flow and minimum cut in network theory, demonstrating its applications through examples and edge-disjoint paths.

Complexity of Algorithms

Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.

BioLocker: A Practical Biometric Authentication Mechanism based on 3D Fingervein

Presents BioLocker, a biometric authentication system using 3D finger vein recognition, covering principles, algorithms, security, and future work.

Max Flav-Min Cut in Directed Graphs

Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.

Flow Networks: Understanding Flows and Cuts in Algorithms

Covers flow networks, focusing on flows, cuts, and their applications in algorithms.

Algorithms & Growth of Functions

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Comparing Hierarchical Clusterings Log in to Mediaspace to watch this video

Covers the derivation and use of a measure of similarity between hierarchical clusterings, focusing on the Bk measure.

Max-flow Min-cut Theorem Log in to Mediaspace to watch this video

Explores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.