Lecture

Graph Algorithms: Ford-Fulkerson and Strongly Connected Components

Related lectures (28)

Graph Algorithms: Flows and Strongly Connected Components

Discusses graph algorithms, focusing on flow networks and strongly connected components.

Algorithms: Union Find and Minimum Spanning Trees

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Graph Algorithms: Modeling and Traversal

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Flow Networks: Understanding Flows and Cuts in Algorithms

Covers flow networks, focusing on flows, cuts, and their applications in algorithms.

Unweighted Bipartite Matching

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Graph Algorithms: Basics

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.

Matroids: Matroid Intersection

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

Graph Theory and Network Flows

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Max Flav-Min Cut in Directed Graphs

Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.

Graph Algorithms: Modeling and Representation

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

Fixed Points in Graph Theory

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Max-flow and Disjoint Sets

Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.

Connectivity in Graph Theory

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

DFS Continuation: Topological Sort

Covers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Polynomial Identity Testing

Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.

Flow Networks: Strongly Connected Components

Introduces Strongly Connected Components and Flow Networks, discussing algorithms and applications.

Graphs: Properties and Representations

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Sparsest Cut: ARV Theorem

Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.