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

Concept

Complement graph

Related lectures (29)

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Covers the Stochastic Block Model for community detection.

Explores linear applications in R² and matrix representation, including basis, operations, and geometric interpretation of transformations.

Covers linear transformations, matrices, kernels, and properties of invertible matrices.

Explores counterfactuals in SEMs and D-Separation in graphical models.

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

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

Introduces algorithms as problem-solving procedures, covering complexity, correctness, and implementation in various languages.

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

Explains the diagonalization of linear transformations using eigenvectors and eigenvalues to form a diagonal matrix.

Covers the Spin Glass Game, belief propagation, and message passing algorithms.

Explores DFS, Topological Sort, SCC in graphs, and introduces Flow Networks with practical examples.

Explores graph algorithms like BFS and DFS, discussing shortest paths, spanning trees, and data structures' role.

Explores the scalar product of vectors, including properties and calculation methods.

Covers the geometry of the triangle, including inequalities, heights, and centers.

Covers the Stochastic Block Model for community detection, focusing on the detection of communities, clusters, and groups.

Covers landmarks, coordinate systems, frames, and terminology in coordinates, emphasizing geometric angles and orthogonal vectors.

Covers the analysis of functions, composition, and mathematical induction.

Explores projections on lines and symmetries in 2D space, emphasizing fixed points and symmetric matrices.

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.