Pages that link to "Item:Q1811623"
From MaRDI portal
The following pages link to A maximum flow algorithm using MA ordering. (Q1811623):
Displaying 3 items.
- The MA-ordering max-flow algorithm is not strongly polynomial for directed networks (Q1433655) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- PRACTICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS USING MA ORDERINGS AND PREFLOWS (Q5469492) (← links)