@inproceedings{2c9eec20c2b841e6a598837ba6a45ea5,
title = "Maximum flows by incremental breadth-First search",
abstract = "Maximum flow and minimum s-t cut algorithms are used to solve several fundamental problems in computer vision. These problems have special structure, and standard techniques perform worse than the special-purpose Boykov-Kolmogorov (BK) algorithm. We introduce the incremental breadth-first search (IBFS) method, which uses ideas from BK but augments on shortest paths. IBFS is theoretically justified (runs in polynomial time) and usually outperforms BK on vision problems.",
author = "Goldberg, {Andrew V.} and Sagi Hed and Haim Kaplan and Tarjan, {Robert E.} and Werneck, {Renato F.}",
year = "2011",
doi = "10.1007/978-3-642-23719-5_39",
language = "English (US)",
isbn = "9783642237188",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "457--468",
booktitle = "Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings",
note = "19th Annual European Symposium on Algorithms, ESA 2011 ; Conference date: 05-09-2011 Through 09-09-2011",
}