The document discusses graph-based algorithms including the Edmonds Karp algorithm and Push-Relable algorithm for maximum flow problems. It explains that the Push-Relable algorithm uses relabeling to increase the height of nodes unable to send data to neighbors of equal height, making them active. It also provides an example of maximum matching in a bipartite graph and mentions transforming bipartite graphs to general graphs for calculating flow.

1. Unit-4
Graph Based Algorithms

3. Edmonds Karp Algorithm

8. Push-Relable Algorithm (P Processing)

9. Push Algorithm

10. Rebel Algorithm

12. We want to send the data to the neighbours but its height is zero so we have to increase it(Same height that’s why
unable to send the data). So we used relable operation. If ht is zero then it is not active node.

13. C is not an active edge or active vertex

22. No link among the people, edges only go from left to right

23. Matching, maximum matching and perfect matching.
If we match e to 5 and d to 4 then becomes the maximum matching

24. How do we transform birpartite graph to general graph for calculating the flow