Pages that link to "Item:Q5469492"
From MaRDI portal
The following pages link to PRACTICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS USING MA ORDERINGS AND PREFLOWS (Q5469492):
Displaying 6 items.
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662) (← links)
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533) (← links)
- The MA-ordering max-flow algorithm is not strongly polynomial for directed networks (Q1433655) (← links)
- A maximum flow algorithm using MA ordering. (Q1811623) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Efficient preflow push algorithms (Q2471239) (← links)