English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 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? In Automata, languages and programming (ICALP-90): 17th international colloquium (pp. 235-248). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE43-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE44-A
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Cheriyan, Joseph1, Author
Hagerup, Torben2, Author           
Mehlhorn, Kurt2, Author           
Paterson, Michael S., Editor
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2006-11-071990
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344542
Other: Local-ID: C1256428004B93B8-A391D1DE09D0E86CC12570840031DFD6-Mehlhorn90c
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Warwick University, England
Start-/End Date: 1990-07-16

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automata, languages and programming (ICALP-90) : 17th international colloquium
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 235 - 248 Identifier: ISBN: 3-540-52826-1

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -