Graph Representation and Traversal

Related lectures (48)

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

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

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

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

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

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

Explores the Cartesian product operation on graphs and introduces the concept of cubes.

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

Focuses on open problems and the importance of reformulating problems with better tools and intuition.

Explains message passing in graphical models and the matching problem in graph theory.

Covers the concept of graph sketching with a focus on connected components.

Explores belief propagation on graphs, emphasizing normalization, recursive relations, and iterative computation of the partition function.

Explores a classic handshake problem at a party using graph representation.

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

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Explores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.

Explores Bellman-Ford algorithm for negative weight graphs and currency exchange rates.

Introduces graph theory basics, Ramsey theory, and graph coloring concepts.

Covers elementary graph algorithms, a midterm exam on algorithmic problem-solving, and distance measurement between strings.

Page 2 of 3