Algorithms Bibliography Chandra S. Chekuri , Andrew V. Goldberg , David R. Karger , Matthew S. Levine , and Cliff Stein . Experimental study of minimum cut algorithms. Selected papers that cite this one David R. Karger and Ray P. Tai. Implementing a fully polynomial time approximation scheme for all terminal network reliability. Selected references Ravindra K. Ahuja, James B. Orlin, and Robert E. Tarjan.
Improved time bounds for the maximum flow problem.
Joseph Cheriyan and Torben Hagerup. A randomized maximum-flow algorithm. Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences. Andrew V. Goldberg and Robert E. Tarjan.