English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Other

Can a maximum flow be computed in $o(nm)$ time?

MPS-Authors

Cheriyan,  Joseph
Max Planck Society;

/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. (1990). Can a maximum flow be computed in $o(nm)$ time?. Saarbrücken, Germany: Teubner.


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