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

Concept

Vertex (graph theory)

Related lectures (30)

Graph Algorithms II: Traversal and Paths

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

Prim's and Kruskal's Algorithms

Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.

Unweighted Bipartite Matching

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

Open Problems

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

Free Energy and Semi-classical Propagator

Explores free energy calculation and semiclassical approximation in quantum physics, focusing on connected diagrams and propagators.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

Markov Chains: Applications and Analysis

Explores Markov chains, focusing on the coloring problem and algorithm analysis.

Belief Propagation

Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.

Renormalization: AQFT

Covers the concept of renormalization in Algebraic Quantum Field Theory.

Linear Programming Duality

Covers linear programming duality and complementary slackness condition.

Seifert van Kampen: demonstration and relationship with rectangles

Covers the demonstration of Seifert van Kampen theorem and the relationship with rectangles and paths.

Subgraphs vs Induced Subgraphs

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

Minimum Guardians in Graphs

Explores the concept of minimizing guardians in graphs through strategic edge selection.

Graph Theory: Path Weighted by Amplitude

Covers the calculation of paths in a graph, focusing on amplitude-weighted paths.

Networks, Flows MOOC: Optimization: principles and algorithms - Network and discrete optimization

Covers the definition of flow in a network and flow calculation.

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.

Embedding Graphs into Trees Log in to Mediaspace to watch this video

Covers embedding graphs into trees with a focus on minimizing distortion and Bartal Tree embeddings.

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

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

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.