## Find a copy in the library

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*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "The two-processor scheduling problem is in random NC".
Be the first.