Pages that link to "Item:Q4540088"
From MaRDI portal
The following pages link to Balanced network flows. III. Strongly polynomial augmentation algorithms (Q4540088):
Displaying 11 items.
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
- Balanced network flows. IV: Duality and structure theory. (Q2744653) (← links)
- Balanced network flows. V: Cycle-canceling algorithms. (Q2744654) (← links)
- Balanced network flows. VI: Polyhedral descriptions. (Q2744655) (← links)
- Balanced network flows. VII: Primal-dual algorithms. (Q2782730) (← links)
- A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION (Q3030554) (← links)
- A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM (Q3489766) (← links)
- Layered Augmenting Path Algorithms (Q3734185) (← links)
- (Q4540086) (← links)
- Balanced network flows. II: Simple augmentation algorithms (Q4540087) (← links)