Experimental Study of Minimum Cut Algorithms (1997)

by Chandra S. Chekuri , Andrew V. Goldberg , David R. Karger , Matthew S. Levine , Cliff Stein
Venue:PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA)
Citations:40 - 2 self

Documents Related by Co-Citation

151 On implementing the push-relabel method for the maximum flow problem – Boris V. Cherkassky, Andrew V. Goldberg - 1994
512 A new approach to the maximum flow problem – Andrew V. Goldberg, Robert E. Tarjan - 1988
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
123 A simple min-cut algorithm – M Stoer, F Wagner - 1997
40 An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree – Bernard M. E. Moret, Henry D. Shapiro - 1994
67 The Influence of Caches on the Performance of Heaps – Anthony LaMarca , Richard E. Ladner
144 Shortest Paths Algorithms: Theory And Experimental Evaluation – Boris Cherkassky, Andrew V. Goldberg, Tomasz Radzik - 1993
15 Implementing an Efficient Minimum Capacity Cut Algorithm – Hiroshi Nagamochi , Tadashi Ono, Toshihide Ibaraki - 1994
1402 Network Flows: Theory, Algorithms, and Applications – R K Ahuja, T L Magnanti, J B Orlin - 1993
95 A new approach to the minimum cut problem – David R. Karger, Clifford Stein - 1996
236 Multi-terminal network flows – R E Gomory, T C Hu - 1961
112 The influence of caches on the performance of sorting – Anthony LaMarca, Richard E. Ladner - 1997
34 An efficient algorithm for the minimum capacity cut problem – M Padberg, G Rinaldi - 1990
272 Maximal Flow through a network – L R Ford Jr, D R Fulkerson - 1956
46 An NC Algorithm for Minimum Cuts – David R. Karger, Rajeev Motwani
268 An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation – Zhenyu Wu, Richard Leahy - 1993
30 Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow Algorithms – Boris V. Cherkassky, Andrew V. Goldberg, Paul Martin, Joao C. Setubal, Jorge Stolfi - 1998
30 A computational comparison of the dinic and network simplex methods for maximum ow – Donald Goldfarb, Michael D Grigoriadis - 1988
643 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999