- Max-flow and min-cut algorithms (Ford-Fulkerson, Edmonds-Karp).
- Bipartite matching using flow reduction techniques.
- Strongly Connected Components (Kosaraju’s/Tarjan’s algorithms).
- Graph coloring strategies for optimization problems.
- Planarity checks and graph embeddings for complex networks.
