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

Local TagsRelease HistoryDetailsSummary

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

Cheriyan, J., Hagerup, T., & Mehlhorn, K. (1990). Can a maximum flow be computed in $o(nm)$ time?. Saarbrücken, Germany: Teubner.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE5B-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE5C-5

Genre: Other

show

show

hide

Creators:
Cheriyan, Joseph¹, Author
Hagerup, Torben², Author
Mehlhorn, Kurt², Author

Affiliations:
1Max Planck Society, ou_persistent13
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Modified: 2006-09-18Date issued: 1990

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken, Germany : Teubner

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344596
Other: Local-ID: C1256428004B93B8-7E19EEBEF919AC1BC12571AA00483ACD-mehlhorn86e

Degree: -

show

show

show

show