Networks: Paths and Components

Related lectures (28)

Page 2 of 3

Explores coordination among agents in networked control systems through graph theory and real-world examples.

Introduces Strongly Connected Components and Flow Networks, discussing algorithms and applications.

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.

Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.

Covers the independence polynomial of a dependency graph and related concepts such as graph coloring and directed graph properties.

Covers flow networks, focusing on flows, cuts, and their applications in algorithms.

Explains the Bellman-Ford algorithm for finding the shortest path in a directed graph with edge weights.

Explores model selection challenges in causal models and the impact of local geometry on statistical inference.

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

Discusses graph algorithms, focusing on flow networks and strongly connected components.