We consider variants of the max-flow min-cut problems in the plane, motivated by models of damage, where certain sets of edges of the graph can be simultaneously removed, rather than one edge at a ...

We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several ...