skip to content
An O(nm log n) algorithm for maximum network flow Preview this item
ClosePreview this item
Checking...

An O(nm log n) algorithm for maximum network flow

Author: Daniel D Sleator
Publisher: Stanford, Calif. : Stanford University, Dept. of Computer Science, ©1981.
Dissertation: Thesis (Ph. D.)--Stanford University, 1980.
Series: Report no. STAN-CS-80-831
Edition/Format:   Thesis/dissertation : Thesis/dissertation : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Thesis/dissertation
Document Type: Book
All Authors / Contributors: Daniel D Sleator
OCLC Number: 7815061
Description: [4], v, [2], 75 p. ; 28 cm.
Series Title: Report no. STAN-CS-80-831
Responsibility: by Daniel Dominic Kaplan Sleator.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/7815061>
library:oclcnum"7815061"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/7815061>
rdf:typej.2:Thesis
rdf:typej.0:Thesis
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
schema:author
schema:copyrightYear"1981"
schema:datePublished"1981"
schema:exampleOfWork<http://worldcat.org/entity/work/id/21471195>
schema:inLanguage"en"
schema:name"An O(nm log n) algorithm for maximum network flow"
schema:publisher
rdf:typeschema:Organization
schema:name"Stanford University, Dept. of Computer Science"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.