Max-flow Min-cut TheoremExplores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.
Max-flow and Disjoint SetsExplores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
Polynomial Identity TestingCovers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Handling Network DataExplores handling network data, including types of graphs, real-world network properties, and node importance measurement.
