Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
نویسندگان
چکیده
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(mn) 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.
منابع مشابه
Maximum Flows by Incremental Breadth-First Search
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 justif...
متن کاملA Breadth-First Representation for Tree Matching in Large Scale Forest-Based Translation
Efficient data structures are necessary for searching large translation rule dictionaries in forest-based machine translation. We propose a breadth-first representation of tree structures that allows trees to be stored and accessed efficiently. We describe an algorithm that allows incremental search for trees in a forest and show that its performance is orders of magnitude faster than iterative...
متن کاملGeneralized Adaptive A*
Agents often have to solve series of similar search problems. Adaptive A* is a recent incremental heuristic search algorithm that solves series of similar search problems faster than A* because it updates the h-values using information from previous searches. It basically transforms consistent hvalues into more informed consistent h-values. This allows it to find shortest paths in state spaces ...
متن کاملSemi-Dynamic Shortest Paths and Breadth-First Search in Digraphs
In this paper we study the problem of maintaining a single source shortest path tree or a breadth-rst search tree for a directed graph, in either an incremental or decremental setting. We maintain a single source shortest path tree of a directed graph G with unit edge weights during a sequence of edge deletions in total time O(mn), thus obtaining a O(n) amortized time for each deletion if the s...
متن کاملState Exploration Choices in a Small-Step Abstract Interpreter
When generating the abstract transition graph while computing k-CFA, the order in which we generate successor states is not important. However, if we are using store widening, the order in which we generate successor states matters because some states will help us jump to the minimum fixed point faster than others. The order in which states are explored is controlled by the work list. The state...
متن کامل