Pages that link to "Item:Q1251587"
From MaRDI portal
The following pages link to An \(O(IVI^3)\) algorithm for finding maximum flows in networks (Q1251587):
Displaying 50 items.
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- Quick max-flow algorithm (Q841606) (← links)
- The maximum flow problem of uncertain network (Q903658) (← links)
- Multiterminal global routing: A deterministic approximation scheme (Q916369) (← links)
- Executability of scenarios in Petri nets (Q1006647) (← links)
- Unimodular functions (Q1079493) (← links)
- A decomposition algorithm for multi-terminal network flows (Q1085042) (← links)
- Multi-terminal maximum flows in node-capacitated networks (Q1085773) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
- Scheduling unit-time jobs on processors with different capabilities (Q1121780) (← links)
- A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980) (← links)
- Algebraic flows in regular matroids (Q1138993) (← links)
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem (Q1147636) (← links)
- An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem (Q1151034) (← links)
- On the theoretical efficiency of various network flow algorithms (Q1154258) (← links)
- The translation square map and approximate congruence (Q1182089) (← links)
- An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems (Q1186949) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- A heuristic for blocking flow algorithms (Q1266732) (← links)
- Computational investigations of maximum flow algorithms (Q1278652) (← links)
- Minimum-weight vertex cover problem for two-class resource connection graphs (Q1310947) (← links)
- A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing (Q1327210) (← links)
- Local optima topology for the \(k\)-coloring problem (Q1327233) (← links)
- Scheduling jobs to minimize total cost (Q1330553) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Source reversal and chip firing on graphs (Q1575961) (← links)
- An algorithmic study of the maximum flow problem: A comparative statistical analysis (Q1592633) (← links)
- Towards equitable distribution via proportional equity constraints (Q1803612) (← links)
- Computing the throughput of a network with dedicated lines (Q1803679) (← links)
- Finding the most vital arcs in a network (Q1823164) (← links)
- A data structure for dynamic trees (Q1838310) (← links)
- Coding distributive lattices with Edge Firing Games. (Q1853051) (← links)
- Sandpile models and lattices: a comprehensive survey (Q1885925) (← links)
- A generalization of the scaling max-flow algorithm (Q1885993) (← links)
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Collision-free routing problem with restricted L-path (Q2161235) (← links)
- Stability of metabolic networks via linear-in-flux-expressions (Q2328345) (← links)
- Evaluating Reliability of Stochastic Flow Networks (Q3415948) (← links)
- A decomposition algorithm for linear relaxation of the weightedr-covering problem (Q3688125) (← links)
- Solving matching problems with linear programming (Q3703653) (← links)
