Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Bipartite double cover

Related lectures (18)

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

Covers recent advancements in the dimer model, emphasizing its applications in probability and conformal field theory.

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.

Covers the Marriage Problem and the Gale Shapley Algorithm to find stable matches.

Explores graphical models, factor graphs, and probabilistic inferences in complex systems.

Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.

Explores the Szemerédi Regularity Lemma, e-regularity in bipartite graphs, supergraph structure, and induction techniques.

Explores bipartite graphs, independent sets, Shearer's Lemma, labeled graphs, and entropy analysis.

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Explores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.

Covers bipartite and n-partite graphs, including complete graph definitions and examples.