Maximum concurrent flows and minimum cuts

This publication has 12 references indexed in Scilit:

• Solution Bases of Multiterminal Cut Problems
  Mathematics of Operations Research, 1988
• An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• On solving large maximum concurrent flow problems
  Published by Association for Computing Machinery (ACM) ,1987
• Multi-terminal maximum flows in node-capacitated networks
  Discrete Applied Mathematics, 1986
• Preface
  Discrete Applied Mathematics, 1985
• Circular Cuts in a Network
  Mathematics of Operations Research, 1980
• On feasibility conditions of multicommodity flows in networks
  IEEE Transactions on Circuit Theory, 1971
• An Efficient Heuristic Procedure for Partitioning Graphs
  Bell System Technical Journal, 1970
• A Suggested Computation for Maximal Multi-Commodity Network Flows
  Management Science, 1958
• Maximal Flow Through a Network
  Canadian Journal of Mathematics, 1956