Codes for Finding Minimum Cuts of Several Kinds in Directed and Undirected Graphs

all-pairs.tar.Z
     Solver for the "all-pairs" minimum cut problem in undirected graphs, see
     R.E. Gomory / T.C.  Multi-Terminal Network Flows, SIAM J. Applied Math. 9
     (1961), for problem specification and D. Gusfield: Very Simple Algorithms
     and Programs for All Pairs Network Flow Analysis, University of California,
     Davis, Computer Science Division, 1987, for a description of underlying
     algorithm, implementation G. Skorobohatyj (ZIB)

 info  -  Brief problem specification, general information on program, and
            description of input data format

ho-undir.tar.Z
     Solver for the global minimum cut problem in undirected graphs, see J. Hao /
     J. B. Orlin, A Faster Algorithm for Finding the Minimum Cut in a Graph, Proc.
     of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando,
     Florida, 1992, for a description of underlying algorithm, implementation by
     G. Skorobohatyj (ZIB)

 info  - General information on program and description of input data format

noi-undir.tar.Z
     Solver for the global minimum cut problem in undirected graphs, see
     H. Nagamochi, T. Ono, and T.  Ibaraki, Implementing an Efficient Minimum
     Cut Algorithm, Technical Report #94011, Kyoto University (1994) for a
     description of underlying algorithm, implementation by G. Skorobohatyj (ZIB)

 info  -  General information on program and description of input data format

global-dir.tar.Z
     Solver for the global minimum cut problem in directed graphs, see J. Hao /
     J.B. Orlin, A Faster Algorithm for Finding the Minimum Cut in a Graph, Proc.
     of the 3rd Annual ACM-SIAM ACM-SIAM Symposium on Discrete Algorithms,
     Orlando, Florida, 1992, for a description of underlying algorithm, implementation
     by G. Skorobohatyj (ZIB)

 info  -  General information on program and description of input data format

odd.tar.Z
     Solver for the "odd" minimum cut problem in undirected graphs, see
     M.W. Padberg / M.R. Rao, Odd Minimum Cut-Sets and b-Matchings,
     Mathematics of Operations research, Vol. 7, No. 1, 1992, for problem
     specification and description of underlying algorithm, implementation
     by G. Skorobohatyj (ZIB)

 info  -    General information on program and description of input data format

Mincutlib
     Collection of minimum cut codes by C.S. Chekuri, A.V. Goldberg, D.R. Karger,
     M.S. Levine, and C. Stein related to the authors' paper Experimental Study
     of Minimum Cut Algorithms, Proceedings of the 8th Annual ACM-SIAM
     Symposium on Discrete Algorithms, 1997 (access to code restricted, also see
     publications page of C.S. Chekuri --> Graph Problems)