Abstract of Paper

Simplifying Flow Networks
by Therese Biedl, Brona Brejova, Tomas Vinar


Maximum flow problems appear in many practical applications.  In this
paper, we study how to simplify a given directed flow network by finding
edges that can be removed without changing the value of the maximum flow.
We give a number of approaches which are increasingly more complex and
more time-consuming, but in exchange they remove more and more edges from
the network.