Lectures related to Prim's and Kruskal's Algorithms

Prim's and Kruskal's Algorithms

Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.

Union-Find and Prim's Algorithm

Introduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.

Union-Find and Minimum Spanning Trees

Covers the Union-Find data structure and Minimum Spanning Trees.

Minimum Spanning Trees: Prim's Algorithm

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

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.

Shortest Paths: Negative Weights & Applications

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

Graph Algorithms II: Traversal and Paths

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

Minimal Spanning Tree

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

Coin Rendering: Part 1 MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Stein Algorithm: Polynomial Identity Testing

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Subgraphs vs Induced Subgraphs

Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.

Belief Propagation: Key Methods and Analysis

Covers Belief Propagation, a key method for both analysis and algorithm.

Bellman-Ford Algorithm: Shortest Path Estimation

Explains the Bellman-Ford algorithm for finding the shortest path in a directed graph with edge weights.

Algorithms & Growth of Functions

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

Minimum Spanning Trees Log in to Mediaspace to watch this video

Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.

Minimum Spanning Trees: Prims Algorithm Log in to Mediaspace to watch this video

Covers minimum spanning trees, disjoint-set data structures, union methods, and Prim's algorithm for finding minimum spanning trees.

Dijkstra's Algorithm and Probabilistic Analysis Log in to Mediaspace to watch this video

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

Dijkstra's Algorithm: All-Pairs Log in to Mediaspace to watch this video

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Network Flow Algorithms Log in to Mediaspace to watch this video

Covers network flow algorithms, including Max Flow, Min Cut, and Negative Cost Cycle Algorithm, progressing from basic definitions to advanced algorithms like Bellman-Ford and Dijkstra's.