An application of submodular flows

This publication has 19 references indexed in Scilit:

• Edge-connectivity augmentation problems
  Journal of Computer and System Sciences, 1987
• Finding feasible vectors of Edmonds-Giles polyhedra
  Journal of Combinatorial Theory, Series B, 1984
• Covering directed and odd cuts
  Published by Springer Nature ,1984
• Minimization on submodular flows
  Discrete Applied Mathematics, 1982
• Minimum cost flow with set‐constraints
  Networks, 1982
• Complexity of Matroid Property Algorithms
  SIAM Journal on Computing, 1982
• Covering the edge set of a directed graph with trees
  Discrete Mathematics, 1978
• A Minimax Theorem for Directed Graphs
  Journal of the London Mathematical Society, 1978
• A generalization of Kónig's theorem
  Acta Mathematica Hungarica, 1970
• A THEOREM ON INDEPENDENCE RELATIONS
  The Quarterly Journal of Mathematics, 1942