Shortest Path in Directed GraphsCovers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Networks: CutsIntroduces cuts in a directed graph, analyzing the flow between two sets.
Network Flows Meets SimplexExplores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.
Networks: DefinitionsCovers the concept of networks, graphs, subgraphs, directed graphs, and indegree in network theory.
