# Excess-Scaling Maximum Flow: Explained
Excess-Scaling Maximum Flow shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Push-relabel variant that only pushes excess above a decreasing threshold Delta, so large pushes happen first and small leftover excess is handled later.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(V^2 E^{1/2}) class bound, often faster in practice than naive FIFO.
## Common mistake
Lowering Delta before every high-excess vertex has been discharged.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.