Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
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.
Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.
Covers network flow algorithms, including Max Flow, Min Cut, and Negative Cost Cycle Algorithm, progressing from basic definitions to advanced algorithms like Bellman-Ford and Dijkstra's.
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
