Lecture
Handshake Problem: Graph Representation
Related lectures (35)
Cartesian Product: Graph Operations
Explores the Cartesian product operation on graphs and introduces the concept of cubes.
Geometry: Eulerian Circuits
Explores Eulerian circuits through the Königsberg bridges problem, leading to the development of graph theory and topology.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Soft Graphs and Subgraphs
Covers soft graphs and induced subgraphs in graph theory.
Graph Theory: Path Weighted by Amplitude
Covers the calculation of paths in a graph, focusing on amplitude-weighted paths.
Minimum Guardians in Graphs
Explores the concept of minimizing guardians in graphs through strategic edge selection.
Message passing in graphical models
Explains message passing in graphical models and the matching problem in graph theory.
Max Sum Diversification
Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Belief Propagation on Graphs
Explores belief propagation on graphs, emphasizing normalization, recursive relations, and iterative computation of the partition function.