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

An O(nmlogn) algorithm for maximum network flow

Author: Daniel D Sleator
Publisher: Stanford, CA : Dept. of Computer Science, Stanford University, [1980], ©1981.
Series: Report (Stanford University. Computer Science Department), no. STAN-CS-80-831.
Edition/Format:   Book   Microform : Microfiche : 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

Document Type: Book
All Authors / Contributors: Daniel D Sleator
OCLC Number: 42710752
Notes: "December 1980."
Originally presented as the author's thesis (Ph. D.--Stanford University, 1980).
Reproduction Notes: Microfiche. [S.l. : s.n., 1981]. 1 microfiche : negative.
Description: v, 75 leaves : illustrations, music.
Series Title: Report (Stanford University. Computer Science Department), no. STAN-CS-80-831.
Responsibility: by Daniel D.K. Sleator.

Reviews

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

Tags

Be the first.
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


Primary Entity

<http://www.worldcat.org/oclc/42710752> # An O(nmlogn) algorithm for maximum network flow
    a schema:Book, schema:CreativeWork, bgn:Microform ;
   library:oclcnum "42710752" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/21471195#Place/stanford_ca> ; # Stanford, CA
   schema:about <http://id.worldcat.org/fast/868961> ; # Combinatorial analysis
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:about <http://id.worldcat.org/fast/1036221> ; # Network analysis (Planning)
   schema:copyrightYear "1981" ;
   schema:creator <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
   schema:datePublished "1980" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/21471195> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/21471195#Series/report_stanford_university_computer_science_department> ; # Report (Stanford University. Computer Science Department) ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/21471195#Series/report_dept_of_computer_science_stanford_university> ; # Report / Dept. of Computer Science, Stanford University ;
   schema:name "An O(nmlogn) algorithm for maximum network flow"@en ;
   schema:productID "42710752" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/42710752#PublicationEvent/stanford_ca_dept_of_computer_science_stanford_university_1980_1981> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/21471195#Agent/dept_of_computer_science_stanford_university> ; # Dept. of Computer Science, Stanford University
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/42710752> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/21471195#Agent/dept_of_computer_science_stanford_university> # Dept. of Computer Science, Stanford University
    a bgn:Agent ;
   schema:name "Dept. of Computer Science, Stanford University" ;
    .

<http://experiment.worldcat.org/entity/work/data/21471195#Series/report_dept_of_computer_science_stanford_university> # Report / Dept. of Computer Science, Stanford University ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/42710752> ; # An O(nmlogn) algorithm for maximum network flow
   schema:name "Report / Dept. of Computer Science, Stanford University ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/21471195#Series/report_stanford_university_computer_science_department> # Report (Stanford University. Computer Science Department) ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/42710752> ; # An O(nmlogn) algorithm for maximum network flow
   schema:name "Report (Stanford University. Computer Science Department) ;" ;
    .

<http://id.worldcat.org/fast/1036221> # Network analysis (Planning)
    a schema:Intangible ;
   schema:name "Network analysis (Planning)"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
   schema:name "Algorithms"@en ;
    .

<http://id.worldcat.org/fast/868961> # Combinatorial analysis
    a schema:Intangible ;
   schema:name "Combinatorial analysis"@en ;
    .

<http://viaf.org/viaf/54241399> # Daniel Dominic Sleator
    a schema:Person ;
   schema:birthDate "1953" ;
   schema:familyName "Sleator" ;
   schema:givenName "Daniel Dominic" ;
   schema:givenName "Daniel D." ;
   schema:name "Daniel Dominic Sleator" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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