English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

An o(n³)-Time Maximum-Flow Algorithm

MPS-Authors
/persons/resource/persons44564

Hagerup,  Torben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Cheriyan, J., Hagerup, T., & Mehlhorn, K. (1996). An o(n³)-Time Maximum-Flow Algorithm. SIAM Journal on Computing, 25(6), 1144-1170. doi:10.1137/S0097539791278376.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB1F-9
Abstract
There is no abstract available