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
Spanning Trees: Definition and Applications
Graph Chatbot
Related lectures (30)
Previous
Page 3 of 3
Next
Max Flav-Min Cut in Directed Graphs
Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.
Belief Propagation
Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Networked Control Systems: Coordination Among Agents
Explores coordination among agents in networked control systems through graph theory and real-world examples.
Cavity Method: Mean Field Theory
Explores the Cavity Method in Mean Field Theory, analyzing spins in an external field within a graph.
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.
Networked Control Systems: Laplacian Flow and Heat Equation
Explores Laplacian flow, heat equation analogies, and microgrid networked controllers.
Convergence of Random Walks
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
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.
