A fast and simple algorithm for the maximum flow problem

Bibliographic Details
Main Authors: Ahuja, Ravindra K., Orlin, James B.
Other Authors: Sloan School of Management.
Format: Working Paper
Published: Cambridge, Mass. : Sloan School of Management, Massachusetts Institute of Technology 2009
Online Access:http://hdl.handle.net/1721.1/47952
_version_ 1826216192215351296
author Ahuja, Ravindra K.
Orlin, James B.
author2 Sloan School of Management.
author_facet Sloan School of Management.
Ahuja, Ravindra K.
Orlin, James B.
author_sort Ahuja, Ravindra K.
collection MIT
first_indexed 2024-09-23T16:43:44Z
format Working Paper
id mit-1721.1/47952
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T16:43:44Z
publishDate 2009
publisher Cambridge, Mass. : Sloan School of Management, Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/479522019-04-10T22:55:36Z A fast and simple algorithm for the maximum flow problem Ahuja, Ravindra K. Orlin, James B. Sloan School of Management. 2009-10-01T21:04:29Z 2009-10-01T21:04:29Z 1987 Working Paper fastsimplealgori00ahuj http://hdl.handle.net/1721.1/47952 18213483 000355676 Working paper (Sloan School of Management) ; 1905-87. application/pdf Cambridge, Mass. : Sloan School of Management, Massachusetts Institute of Technology
spellingShingle Ahuja, Ravindra K.
Orlin, James B.
A fast and simple algorithm for the maximum flow problem
title A fast and simple algorithm for the maximum flow problem
title_full A fast and simple algorithm for the maximum flow problem
title_fullStr A fast and simple algorithm for the maximum flow problem
title_full_unstemmed A fast and simple algorithm for the maximum flow problem
title_short A fast and simple algorithm for the maximum flow problem
title_sort fast and simple algorithm for the maximum flow problem
url http://hdl.handle.net/1721.1/47952
work_keys_str_mv AT ahujaravindrak afastandsimplealgorithmforthemaximumflowproblem
AT orlinjamesb afastandsimplealgorithmforthemaximumflowproblem
AT ahujaravindrak fastandsimplealgorithmforthemaximumflowproblem
AT orlinjamesb fastandsimplealgorithmforthemaximumflowproblem