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
Concept
Maximum cardinality matching
Graph Chatbot
Related lectures (28)
Login to filter by course
Login to filter by course
Reset
Previous
Page 2 of 3
Next
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: Stable Matchings
Covers the concept of stable matchings and the Gale-Shapley algorithm.
Max-flow and Disjoint Sets
Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
Ford-Fulkerson Method: Disjoint-set Data Structures
Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.
Boolean Hidden Matching Problem
Covers the Boolean Hidden Matching Problem and its applications to lower bounds.
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.
Optimization Programs: Piecewise Linear Cost Functions
Covers the formulation of optimization programs for minimizing piecewise linear cost functions.
