|
119
|
On implementing the push-relabel method for the maximum flow problem
– Boris V. Cherkassky, Andrew V. Goldberg
- 1994
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
391
|
A new approach to the maximum flow problem
– Andrew V. Goldberg, Robert E. Tarjan
- 1988
|
|
39
|
An NC Algorithm for Minimum Cuts
– David R. Karger, Rajeev Motwani
|
|
66
|
The Influence of Caches on the Performance of Heaps
– Anthony LaMarca , Richard E. Ladner
|
|
124
|
Shortest Paths Algorithms: Theory And Experimental Evaluation
– Boris Cherkassky, Andrew V. Goldberg, Tomasz Radzik
- 1993
|
|
38
|
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree
– Bernard M. E. Moret, Henry D. Shapiro
- 1994
|
|
1107
|
Network Flows: Theory, Algorithms, and Applications
– Ravindra K Ahuja, Thomas L Magnanti, James B Orlin
- 1993
|
|
83
|
A new approach to the minimum cut problem
– David R. Karger, Clifford Stein
- 1996
|
|
104
|
The influence of caches on the performance of sorting
– Anthony LaMarca, Richard E. Ladner
- 1997
|
|
200
|
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
– Zhenyu Wu, Richard Leahy
- 1993
|
|
20
|
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
|
|
26
|
A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow." Annals of Operation Research
– D Goldfarb, M D Grigoriadis
- 1988
|
|
593
|
LEDA: A Platform for Combinatorial and Geometric Computing
– Kurt Mehlhorn, Stefan Näher, Christian Uhrig
- 1999
|
|
93
|
F: A simple min-cut algorithm
– M Stoer, Wagner
- 1997
|
|
117
|
The Stanford GraphBase: A Platform for Combinatorial Computing
– D E Knuth
- 1993
|
|
12
|
Implementing an Efficient Minimum Capacity Cut Algorithm
– Hiroshi Nagamochi , Tadashi Ono, Toshihide Ibaraki
- 1994
|
|
100
|
The complexity of counting cuts and of computing the probability that a graph is connected
– J S Provan, M O Ball
- 1983
|
|
334
|
The complexity of enumeration and reliability problems
– L G Valiant
- 1979
|
