A matching in graph theory is a set of edges without common vertices. Each vertex can only appear in one edge of the matching. Finding a matching in a bipartite graph can be treated as a network flow problem.
Stanford University
Autumn 2022
The course addresses both classic and recent developments in counting and sampling. It covers counting complexity, exact counting via determinants, sampling via Markov chains, and high-dimensional expanders.
No concepts data
+ 52 more concepts