Lectures related to Flow Networks: Strongly Connected Components

Explores simple paths, connectivity, equivalence classes, and connected components in directed graphs.

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

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

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

Introduces the concept of categories essential for understanding group theory.

Explores ecological vision and computational agent design in the context of visual perception and behavior.

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

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.