Q4812956
type: Item
instance of: scholarly article
zbMATH Open document ID: 1176.90513
publication date: 2004-08-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 2094562
MaRDI profile type: Publication
Recommended article: A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
Recommended article: A parametric maximum flow algorithm for bipartite graphs with applications
Recommended article: Q4318266
Recommended article: TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
Recommended article: Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
Recommended article: Algorithms and complexity for the almost equal maximum flow problem
Recommended article: The symbolic algorithms for maximum flow in networks
Recommended article: A Fast and Simple Algorithm for the Maximum Flow Problem
Recommended article: Q3840369
Recommended article: On the complexity of the dual method for maximum balanced flows
description: scientific article; zbMATH DE number 2094562