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
Unweighted Bipartite Matching
Graph Chatbot
Related lectures (54)
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.
Graph Algorithms: Ford-Fulkerson and Strongly Connected Components
Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
Linear Programming Duality
Covers linear programming duality and complementary slackness condition.
Linear Programming Duality
Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Graph Algorithms II: Traversal and Paths
Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Information Theory: Basics
Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.
Functions: Definitions and Notations
Covers the generalities of functions, including the definition of an application between sets and the uniqueness of elements in the image set.
Belief Propagation
Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.
Dynamic Programming: Shortest Paths Algorithms
Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.
Set Cover: Integrality Gap
Explores the integrality gap concept in set cover and multiplicative weights algorithms.
Graph Sketching: Connected Components
Log in to Mediaspace to watch this video
Covers the concept of graph sketching with a focus on connected components.
Cheeger's Inequalities
Log in to Mediaspace to watch this video
Explores Cheeger's inequalities for random walks on graphs and their implications.
Sparsest Cut: ARV Theorem
Log in to Mediaspace to watch this video
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
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.
Interlacing Families and Ramanujan Graphs
Log in to Mediaspace to watch this video
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
Szemerédi Regularity Lemma
Log in to Mediaspace to watch this video
Explores the Szemerédi Regularity Lemma, e-regularity in bipartite graphs, supergraph structure, and induction techniques.
Previous
Page 1 of 3
Next
