Orientation (graph theory)

Related lectures (28)

Page 2 of 3

Explores dynamic programming for the Knapsack Problem, optimizing weight accumulation and profit subsets efficiently.

Covers the concept of formal proof systems, their structure, and soundness.

Explores the high-temperature expansion of the Ising model in 2D square lattice.

Covers the origins and types of NoSQL databases, focusing on MongoDB and CRUD operations.

Explores the Laplacian matrix in electric and mechanical networks, consensus, and properties of Laplacian matrices in networked control systems.

Explores depth-first search, breadth-first search, graph representation, and topological sorting in graphs.

Covers Cayley graphs, generators, group examples, and graph structures.

Covers Linearity of Expectation, Markov's inequality, random variables, and transitive tournaments.

Covers sparsest cut, NP-completeness, Bougains Theorem, and concurrent flow in graphs.

Covers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.