Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.
Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.
Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.
