skip to content
Complexity of combinatorial algorithms Preview this item
ClosePreview this item
Checking...

Complexity of combinatorial algorithms

Author: Robert E Tarjan; Stanford University. Computer Science Department.
Publisher: Stanford, Calif. : Computer Science Dept., Stanford University, 1976.
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: Robert E Tarjan; Stanford University. Computer Science Department.
OCLC Number: 3822795
Notes: STAN-CS-77-609.
Partially supported by NSF grant MCS75-22870 and ONR contract N00014-76-C-0668.
Reproduction Notes: Microfiche (negative).
Description: 1 sheet (i, 86 pages) ; 11 x 15 cm
Responsibility: Robert Endre Tarjan.

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/3822795>
library:oclcnum"3822795"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/3822795>
rdf:typeschema:Book
rdf:typej.2:Microform
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/239748731>
rdf:typeschema:Organization
schema:name"Stanford University. Computer Science Department."
schema:creator
schema:datePublished"1976"
schema:exampleOfWork<http://worldcat.org/entity/work/id/12860622>
schema:inLanguage"en"
schema:name"Complexity of combinatorial algorithms"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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