Graph (discrete mathematics)

Related lectures (30)

Page 1 of 3

Covers the concept of the exponential family and discusses forward and backward maps, expensive computations, parameters, functions, and convexity.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

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

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

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

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

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

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Explores coordination in networked control systems, graph theory, and consensus algorithms.

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