2011 | OriginalPaper | Buchkapitel
Maximum Flows by Incremental Breadth-First Search
verfasst von : Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan, Renato F. Werneck
Erschienen in: Algorithms – ESA 2011
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.