Abstract
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.
Cite
CITATION STYLE
APA
Biedl, T. C., Brejová, B., & Vinař, T. (2000). Simplifying flow networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1893, pp. 192–201). Springer Verlag. https://doi.org/10.1007/3-540-44612-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free