skip to content
The two-processor scheduling problem is in random NC Preview this item
ClosePreview this item
Checking...

The two-processor scheduling problem is in random NC

Author: Umesh Virkumar Vazirani; Vijay V Vazirani
Publisher: Ithaca, N.Y. : Cornell University, Dept. of Computer Science, 1989.
Series: Cornell University.; Department of Computer Science.; Technical report
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "An efficient parallel algorithm (RNC[superscript 2]) for the two-processor scheduling problem is presented. An interesting feature of this algorithm is that it finds a highest level first schedule: such a schedule defines a lexicographically first solution to this problem in a natural way. A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a one-to-one  Read more...
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: Umesh Virkumar Vazirani; Vijay V Vazirani
OCLC Number: 22361081
Notes: "May 1989."
Description: 23 pages ; 28 cm.
Series Title: Cornell University.; Department of Computer Science.; Technical report
Responsibility: Umesh Vazirani, Vijay Vazirani.

Abstract:

Abstract: "An efficient parallel algorithm (RNC[superscript 2]) for the two-processor scheduling problem is presented. An interesting feature of this algorithm is that it finds a highest level first schedule: such a schedule defines a lexicographically first solution to this problem in a natural way. A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a one-to-one correspondence between the bases of the Tutte matrix of a graph and the sets of matched nodes in maximum matchings in the graph."

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


<http://www.worldcat.org/oclc/22361081>
library:oclcnum"22361081"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/22361081>
rdf:typeschema:Book
schema:about
schema:about
<http://id.worldcat.org/fast/1052928>
rdf:typeschema:Intangible
schema:name"Parallel processing (Electronic computers)"@en
schema:about
<http://id.worldcat.org/fast/1078354>
rdf:typeschema:Intangible
schema:name"Production scheduling"@en
schema:name"Production scheduling."@en
schema:about
schema:contributor
schema:creator
schema:datePublished"1989"
schema:description"Abstract: "An efficient parallel algorithm (RNC[superscript 2]) for the two-processor scheduling problem is presented. An interesting feature of this algorithm is that it finds a highest level first schedule: such a schedule defines a lexicographically first solution to this problem in a natural way. A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a one-to-one correspondence between the bases of the Tutte matrix of a graph and the sets of matched nodes in maximum matchings in the graph.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/24031742>
schema:inLanguage"en"
schema:name"The two-processor scheduling problem is in random NC"@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.