Lectures related to Borůvka's algorithm

Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.

Explores rounding the relaxation and Max Sum Diversification, discussing effects, integral solutions, and loss bounds.

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

Introduces SCOAP measures for testability analysis in VLSI systems, covering controllability, observability, and test vector length prediction.

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