Augmenting Graphs to Meet Edge-Connectivity Requirements

This publication has 21 references indexed in Scilit:

• An application of submodular flows
  Linear Algebra and its Applications, 1989
• The minimum augmentation of any graph to a K‐edge‐connected graph
  Networks, 1989
• Generalized polymatroids and submodular flows
  Mathematical Programming, 1988
• GENERALIZED POLYMATROIDS
  Published by Elsevier ,1984
• Feature Article—The Ellipsoid Method: A Survey
  Operations Research, 1981
• How to make a digraph strongly connected
  Combinatorica, 1981
• Matroid Intersection
  Annals of Discrete Mathematics, 1979
• Augmentation Problems
  SIAM Journal on Computing, 1976
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
  Journal of the ACM, 1972
• Connectivity considerations in the design of survivable networks
  IEEE Transactions on Circuit Theory, 1970