Kőnig's theorem (graph theory)

Related lectures (20)

Page 2 of 2

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

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

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.

Explores graphical models, factor graphs, and probabilistic inferences in complex systems.

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

Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.

Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.