Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Algorithms: Stable Matchings
Graph Chatbot
Related lectures (23)
Previous
Page 2 of 3
Next
The Marriage Problem
Explores the marriage problem, where a bride must strategically accept suitors to maximize her chances of selecting the best one.
Mean field computation
Explores the computation of mean field and effective field in message passing algorithms.
Spin Model Exercises
Covers exercises on the spin model, independent set, matching, and increasing functions.
Message passing in graphical models
Explains message passing in graphical models and the matching problem in graph theory.
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.
The Marriage Problem
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 and Disjoint Sets
Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
Matching Polynomials: Real-Rootedness and Signings
Explores matching polynomials, real-rootedness, signings, matchings sizes, and Hermann-Lieb condition.
Ford-Fulkerson Method: Disjoint-set Data Structures
Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.
Comparing Hierarchical Clusterings
Covers the derivation and use of a measure of similarity between hierarchical clusterings, focusing on the Bk measure.
