Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Prim's and Kruskal's Algorithms

Related lectures (32)

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

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

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

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

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

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

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.

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

Explores a variety of open problems in graph theory and computational complexity, challenging students to analyze and solve complex issues.

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

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

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

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

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

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

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

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

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.

Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.

Page 1 of 2