Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Minimum Spanning Trees
Graph Chatbot
Related lectures (30)
Previous
Page 3 of 3
Next
Graph Algorithms: Ford-Fulkerson and Strongly Connected Components
Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.
Union-Find and Minimum Spanning Trees
Covers the Union-Find data structure and Minimum Spanning Trees.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Dynamic Programming: Knapsack
Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
Dynamic Programming: Pascal's Triangle & Floyd's Algorithm
Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.
Graph Theory and Network Flows
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Bellman-Ford Algorithm: Shortest Path Estimation
Explains the Bellman-Ford algorithm for finding the shortest path in a directed graph with edge weights.
Minimum Guardians in Graphs
Explores the concept of minimizing guardians in graphs through strategic edge selection.
Networks: Trees
Explains the concept of trees in graph theory and the definition of a spanning tree.
