The following pages link to (Q3840368):
Displaying 5 items.
- Improving time bounds on maximum generalised flow computations by contracting the network (Q1884873) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- Generalized max flow in series-parallel graphs (Q2445843) (← links)
- Maximum flow problem in wireless ad hoc networks with directional antennas (Q2458905) (← links)
- Generalized maximum flow over time with intermediate storage (Q6546986) (← links)
