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

Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt

doi:10.1137/S0097539791278376

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB1F-9 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-44F3-3

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

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

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2006-08-23Published Online: 2006Date issued: 1996

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 344421
Other: Local-ID: C1256428004B93B8-BBE2484C8F3EA24AC125642E00537985-Cheriyan-Hagerup-Mehlhorn96
DOI: 10.1137/S0097539791278376
BibTex Citekey: Mehlhorn-et-al_SIAM.J.Comput.96

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Philadelphia, PA : SIAM

Pages: - Volume / Issue: 25 (6) Sequence Number: - Start / End Page: 1144 - 1170 Identifier: ISSN: 0097-5397
CoNE: https://pure.mpg.de/cone/journals/resource/954925466249