Login to filter by course Login to filter by course Reset
Explores topological sort, acyclic graphs, Strongly Connected Components, magic algorithm, component graph, flow networks, and their applications.
Covers the concepts of local homeomorphisms and coverings in manifolds, emphasizing the conditions under which a map is considered a local homeomorphism or a covering.
Explains the concept of trees in graph theory and the definition of a spanning tree.
Introduces induced flows, basis matrices, and tree solutions in graph theory.
Covers the definition of flow in a network and flow calculation.
Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.
