Results 1 
3 of
3
An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2001
"... After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time compl ..."
Abstract

Cited by 1200 (52 self)
 Add to MetaCart
(Show Context)
After [10, 15, 12, 2, 4] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in lowlevel vision. The combinatorial optimization literature provides many mincut/maxflow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper
Maximum skewsymmetric flows and matchings
 MATHEMATICAL PROGRAMMING
, 2004
"... The maximum integer skewsymmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of selfconjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical r ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
The maximum integer skewsymmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of selfconjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical results on usual network flows, such as the flow decomposition, augmenting path, and maxflow mincut theorems. We give unified and shorter proofs for those theoretical results. We then extend to MSFP the shortest augmenting path method of Edmonds and Karp [7] and the blocking flow method of Dinits [4], obtaining algorithms with similar time bounds in general case. Moreover, in the cases of unit arc capacities and unit “node capacities ” the blocking skewsymmetric flow algorithm has time bounds similar to those established in [8, 21] for Dinits ’ algorithm. In particular, this implies an algorithm for finding a maximum matching in a nonbipartite graph in O ( √ nm) time, which matches the time bound for the algorithm of Micali and Vazirani [25]. Finally, extending a clique compression technique of Feder and Motwani [9] to particular skewsymmetric graphs, we speed up the implied maximum matching algorithm to run in O ( √ nm log(n 2 /m)/log n) time, improving the best known bound for dense nonbipartite graphs. Also other theoretical and algorithmic results on skewsymmetric flows and their applications are presented.