Max-flow Min-cut TheoremExplores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.
Girvan-Newman AlgorithmIntroduces the Girvan-Newman Algorithm for network decomposition based on edge betweenness and demonstrates its application in physics collaborations.
Max-Flow Min-CutExplores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.
Topological Sort and SCCExplores topological sort, acyclic graphs, Strongly Connected Components, magic algorithm, component graph, flow networks, and their applications.
Network Flows Meets SimplexExplores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.
