|
|
[Next][Prev] [_____] [Left] [Up] [Index] [Root]
Bibliography
- CG97
-
B.V. Cherkassky and A.V. Golberg.
On Implementing the Push-Relabel Method for the Maximum Flow Problem.
Algorithmica, 19:390--410, 1997.
- CGM+98
-
B.V. Cherkassky, A.V. Golberg, Paul Martin, J.C. Setubal, and J. Stolfi.
Augment or Push? A Computational Study of Bipartite Matching and Unit Capacity Flow Algorithms.
Technical report, NEC Research Institute, 1998.
- Eve79
-
Shimon Even.
Graph Algorithms.
Computer Science Press, 1979.
- RAO93
-
T.L. Magnanti R.K. Ahuja and J.B. Orlin.
Network Flows, Theory, Algorithms, and Applications.
Prentice Hall, 1993.
[Next][Prev] [_____] [Left] [Up] [Index] [Root]
|
|
