Iterative algorithms for generating minimal cutsets in directed graphs

This publication has 26 references indexed in Scilit:

• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
  Journal of the ACM, 1980
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
  Networks, 1979
• On algorithms for finding the k shortest paths in a network
  Networks, 1979
• Iterative methods for determining the k shortest paths in a network
  Networks, 1976
• A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
  Journal of the ACM, 1976
• A decomposition algorithm for optimality problems in tree-structured networks
  Discrete Mathematics, 1973
• An Algebra for Network Routing Problems
  IMA Journal of Applied Mathematics, 1971
• An Implicit Enumeration Scheme for Proper Cut Generation
  Technometrics, 1970
• Proper flow paths in vertex-weighted communication nets
  Proceedings of the Institution of Electrical Engineers, 1968
• The path matrix and switching functions
  Journal of the Franklin Institute, 1959