Minimum Spanning Trees: Cut Property

Lecture 35 of CS502 Fundamentals of Algorithms establishes the theoretical foundations of the Minimum Spanning Tree (MST) problem. Given a connected, undirected graph G = (V, E) with a weight function w: E -> R, a spanning tree is an acyclic connected subgraph T that connects all vertices in V using exactly |V| - 1 edges. The Minimum Spanning Tree is a spanning tree whose total edge weight sum w(T) = sum w(e) is minimized. MSTs model essential infrastructure networks such as telecommunications routing, power grids, and pipeline construction. The lecture formalizes the Cut Property, the bedrock theorem for greedy MST algorithms. A cut (S, V - S) partitions vertices into two disjoint sets. An edge crosses the cut if one endpoint is in S and the other in V - S. A cut respects an edge set A if no edge in A crosses the cut. An edge is a light edge crossing a cut if its weight is minimum among all edges crossing that cut. The Cut Property proves that adding any light edge crossing a cut respecting A is safe for the MST. Breadth-first and depth-first search mechanics, discovery and finishing timestamps, and edge classifications are systematically analyzed. Greedy strategies including Huffman prefix tree generation and activity scheduling are rigorously proven using exchange arguments. Scholars examine shortest path optimality conditions, edge relaxation properties, and negative cycle detection algorithms. Minimum spanning tree algorithms including Kruskal and Prim formulations are analyzed alongside union-find disjoint set operations. Computational complexity concepts are illustrated through polynomial-time verification, decision reductions, and NP-completeness proofs. By engaging with solved past papers by Moaaz and Waqar Siddhu, learners gain actionable insights into recurrent university exam questions. Interactive quiz assessments on VU SIGMA facilitate rapid knowledge verification and retention of critical algorithmic concepts. Comprehensive coverage of standard academic benchmarks ensures learners communicate with technical precision across computational disciplines. Detailed analysis of recurrence relations highlights the imperative of analyzing base cases and recursive branching factors accurately.