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.
Polynomial Identity TestingCovers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
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.
Minimal Spanning TreeCovers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.
