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

Home

Lecture

Minimum Guardians in Graphs

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Cheeger's Inequalities Log in to Mediaspace to watch this video

Explores Cheeger's inequalities for random walks on graphs and their implications.

Spanning Trees: Definition and Applications Log in to Mediaspace to watch this video

Introduces spanning trees in graphs and the Minimum Spanning Tree problem, exploring efficient algorithms for optimal decision-making.

Relations Between Events Log in to Mediaspace to watch this video

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.

Graph Theory and Network Flows Log in to Mediaspace to watch this video

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Convergence of Random Walks Log in to Mediaspace to watch this video

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

Statistical analysis of network data Log in to Mediaspace to watch this video

Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.

Dijkstra's Algorithm Overview Log in to Mediaspace to watch this video

Demonstrates the iterative process of applying Dijkstra's algorithm to find optimal paths.

Assembly: Physics of Manufacturing Log in to Mediaspace to watch this video

Discusses the importance of assembly in manufacturing and covers common couplings, stability, and spatial vectors.

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.

Sparsest Cut: ARV Theorem Log in to Mediaspace to watch this video

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.

Interlacing Families and Ramanujan Graphs Log in to Mediaspace to watch this video

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Linearity of Expectation: First Moment Method Log in to Mediaspace to watch this video

Introduces Linearity of Expectation and the First Moment Method, explores probability theory problems like Buffon's Needle, and discusses transitive tournaments and Ham paths.

Page 2 of 2