Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.
Explores the Matrix Tree Theorem and its application in calculating spanning trees in graphs.
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Explores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.
Explains the concept of trees in graph theory and the definition of a spanning tree.
Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.
