The complexity of minimum cut and maximum flow problems in an acyclic network

This publication has 10 references indexed in Scilit:

• A new approach to the maximum flow problem
  Published by Association for Computing Machinery (ACM) ,1986
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• Constructing a perfect matching is in random NC
  Published by Association for Computing Machinery (ACM) ,1985
• A data structure for dynamic trees
  Journal of Computer and System Sciences, 1983
• Data Structures and Network Algorithms
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1983
• The maximum flow problem is log space complete for P
  Theoretical Computer Science, 1982
• Robust linear algorithms for cutsets
  Journal of Algorithms, 1982
• A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
  SIAM Journal on Computing, 1979
• An O(|V|3) algorithm for finding maximum flows in networks
  Information Processing Letters, 1978
• Flows in Networks
  Published by Walter de Gruyter GmbH ,1963