Prim's and Kruskal's AlgorithmsExplores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Minimal Spanning TreeCovers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.
Relations Between EventsExplores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
Union-Find and Prim's AlgorithmIntroduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.
Max Sum DiversificationExplores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Distances and Motif CountsExplores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.
Subgraphs vs Induced SubgraphsDistinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.
