Lectures related to Algorithms: Union Find and Minimum Spanning Trees

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

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

Explores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.

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

Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.

Explores coordination in networked control systems, graph theory, and consensus algorithms.

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.