Is there an example of Dinitz’s algorithm running with the worst time complexity?

I am trying to find a network, where Dinic’s algorithm makes $|V|^2*|E|$ steps. Clearly it cannot be a network with $3$ or less vertices, but I am not able to come up with a working example for quite a while now.

Any idea?

Leave a Reply

Your email address will not be published. Required fields are marked *