Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Greedy Change-Making Algorithm: Optimality and Stability
Graph Chatbot
Related lectures (24)
Algorithms: Stable Matchings
Covers the concept of stable matchings and the Gale-Shapley algorithm.
Algorithms: Stable Matchings
Covers the concept of stable matchings and the Gale-Shapley algorithm.
Marriage Problem: Gale Shapley Algorithm
Covers the Marriage Problem and the Gale Shapley Algorithm to find stable matches.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Linear Programming Duality
Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.
Matroids: Matroid Intersection
Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.
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.
Graph Algorithms: Ford-Fulkerson and Strongly Connected Components
Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.
Spin Model Exercises
Covers exercises on the spin model, independent set, matching, and increasing functions.
Ford-Fulkerson Method: Disjoint-set Data Structures
Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.
Complexity of Algorithms
Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.
The Marriage Problem
Log in to Mediaspace to watch this video
Explores the marriage problem, where a bride must strategically accept suitors to maximize her chances of selecting the best one.
The Marriage Problem
Log in to Mediaspace to watch this video
Explores the marriage problem, modeling the process as a controlled stochastic process with dynamic programming algorithms to find the optimal policy for accepting bachelors.
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.
Mean field computation
Log in to Mediaspace to watch this video
Explores the computation of mean field and effective field in message passing algorithms.
Message passing in graphical models
Log in to Mediaspace to watch this video
Explains message passing in graphical models and the matching problem in graph theory.
Max-flow and Disjoint Sets
Log in to Mediaspace to watch this video
Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
Matching Polynomials: Real-Rootedness and Signings
Log in to Mediaspace to watch this video
Explores matching polynomials, real-rootedness, signings, matchings sizes, and Hermann-Lieb condition.
Previous
Page 1 of 2
Next
