Algorithms - ESA 2015 pp 619-630
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
- Cite this paper as:
- Goldberg A.V., Hed S., Kaplan H., Kohli P., Tarjan R.E., Werneck R.F. (2015) Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search. In: Bansal N., Finocchi I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science, vol 9294. Springer, Berlin, Heidelberg
We introduce the Excesses Incremental Breadth-First Search (Excesses IBFS) algorithm for maximum flow problems. We show that Excesses IBFS has the best overall practical performance on real-world instances, while maintaining the same polynomial running time guarantee of O(mn2) as IBFS, which it generalizes. Some applications, such as video object segmentation, require solving a series of maximum flow problems, each only slightly different than the previous. Excesses IBFS naturally extends to this dynamic setting and is competitive in practice with other dynamic methods.
Unable to display preview. Download preview PDF.