Pages that link to "Item:Q3033534"

The following pages link to A Fast and Simple Algorithm for the Maximum Flow Problem (Q3033534):

Displayed 22 items.

• Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274) ‎ (← links)
• The maximum flow problem: A max-preflow approach (Q811325) ‎ (← links)
• Generating pseudo-random permutations and maximum flow algorithms (Q915489) ‎ (← links)
• Due dates assignment and JIT scheduling with equal-size jobs (Q976442) ‎ (← links)
• Dual coordinate step methods for linear network flow problems (Q1115790) ‎ (← links)
• Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) ‎ (← links)
• Processor-efficient implementation of a maximum flow algorithm (Q1178222) ‎ (← links)
• Finding minimum-cost flows by double scaling (Q1184348) ‎ (← links)
• A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076) ‎ (← links)
• Auction algorithms for network flow problems: A tutorial introduction (Q1202585) ‎ (← links)
• Computational investigations of maximum flow algorithms (Q1278652) ‎ (← links)
• A new saling algorithm for the maximum mean cut problem (Q1317477) ‎ (← links)
• A fast algorithm for the minimax flow problem with 0/1 weights (Q1370418) ‎ (← links)
• Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) ‎ (← links)
• Minimum cut problem using bases of extended polymatroids (Q1385774) ‎ (← links)
• An algorithmic study of the maximum flow problem: A comparative statistical analysis (Q1592633) ‎ (← links)
• Sequential and parallel algorithms for minimum flows. (Q1880468) ‎ (← links)
• A generalization of the scaling max-flow algorithm (Q1885993) ‎ (← links)
• Minimum cuts in parametric networks (Q1905228) ‎ (← links)
• An auction algorithm for the max-flow problem (Q1906750) ‎ (← links)
• (Q4519920) ‎ (← links)
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) ‎ (← links)